Results 41 to 50 of about 24,570,426 (223)
Interval vs. Point Temporal Logic Model Checking [PDF]
Foundations of Software Technology and Theoretical Computer Science, 2017 In recent years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL*, and the like. The behavior of the system is modeled by means of (finite)
L. Bozzelli +4 more
semanticscholar +1 more source
LTL Model Checking Based on Binary Classification of Machine Learning
IEEE Access, 2019 Linear Temporal Logic (LTL) Model Checking (MC) has been applied to many fields. However, the state explosion problem and the exponentially computational complexity restrict the further applications of LTL model checking.
Weijun Zhu, Huanmei Wu, Miaolei Deng
doaj +1 more source
Social Choice Methods for Database Aggregation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of information coming from multiple sources, each source submitting a database ...
Francesco Belardinelli, Umberto Grandi
doaj +1 more source
Learning-Based Testing Using SAL (Symbolic Analysis Laboratory) Model Checker
NUML International Journal of Engineering and Computing, 2023 This paper studies learning-based testing (LBT) for reactive systems with different learning algorithms and model checkers. LBT is a technique that requires a learning algorithm to learn the models to generate test cases automatically.
Anjum Ara Shah, Muddassar Azam Sindhu
doaj +1 more source
Model-checking of infinite Kripke structures defined by simple graph grammars
SEGRAGRA, 1995 We present an algorithm for checking whether an infinite transition system, defined by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL.
Y. Quemener, Thierry Jéron
semanticscholar +1 more source
On the Definability Problem of First-Order Sentences by Propositional Intuitionistic Formulas
AxiomsWe consider restricted forms of the algorithmic problem of definability of first-order sentences by propositional formulas with intuitionistic Kripke frames semantics.
Grigor Kolev, Tinko Tinchev
doaj +1 more source
Nested Hoare Triples and Frame Rules for Higher-order Store [PDF]
Logical Methods in Computer Science, 2011 Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the ...
Jan Schwinghammer +3 more
doaj +1 more source
Formulas Expressing Totally Nonstable Truth Values of Formulas
Известия Иркутского государственного университета: Серия "Математика", 2023 In this short paper we consider problem of nonstable truth values of formulas. We investigate temporal-modal logic for description of reliability information. The logic itself is generated by rather standard models on linear time.
V.V. Rybakov +2 more
doaj +1 more source
Journal of Sleep Research, EarlyView.ABSTRACT This systematic literature review evaluated the risks of using benzodiazepine medications for more than 3 months in adults with chronic insomnia. Chronic insomnia is defined as ongoing dissatisfaction with sleep quantity or quality, causing significant distress and impaired functioning during the day.
Dieter Riemann +7 more
wiley +1 more source
Strong Completeness and the Finite Model Property for Bi-Intuitionistic Stable Tense Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.
Katsuhiko Sano, John G. Stell
doaj +1 more source