Results 1 to 10 of about 24,570,426 (223)
A Kripke model for simplicial sets
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Bezem, T. Coquand
semanticscholar +4 more sources
On Model Checking Durational Kripke Structures [PDF]
Lecture Notes in Computer Science, 2002 We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied.We investigate the conditions that allow polynomial-time model checking algorithms for timed ...
F. Laroussinie +2 more
semanticscholar +4 more sources
Localizing finite-depth Kripke models [PDF]
Logic Journal of the IGPL, 2017 We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language, local ...
Mojtaba Mojtahedi
semanticscholar +4 more sources
Refinement of Kripke Models for Dynamics [PDF]
Lecture Notes in Computer Science, 2008 We propose a property-preserving refinement/abstraction theory for Kripke Modal Labelled Transition Systems incorporating not only state mapping but also label and proposition lumping, in order to have a compact but informative abstraction. We develop a 3-valued version of Public Announcement Logic (PAL) which has a dynamic operator that changes the ...
Francien Dechesne, , Simona Orzan
exaly +3 more sources
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption [PDF]
Logical Methods in Computer Science, 2022 The expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning.
Laura Bozzelli +4 more
doaj +3 more sources
Archive for Mathematical Logic, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albert Visser
exaly +5 more sources
A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The usual epistemic model S5n for a multi-agent system is based on a Kripke frame, which is a graph whose edges are labeled with agents that do not distinguish between two states.
Éric Goubault +2 more
doaj +3 more sources
On the Finite Model Property for Kripke Models
Publications of the Research Institute for Mathematical Sciences, 1971 This work is a sequel to Q4]. The familiarity with the results and terminology of T4] is presupposed. It is a well-known fact that the intuitionistic prepositional logic (abbreviated as LJ) has not a finite characteristic model. But, Jaskowski proved that there is a monotonic descending sequence of finite models which converges to LJ.
H. Ono
semanticscholar +4 more sources
Weak Arithmetics and Kripke Models
Mathematical Logic Quarterly, 2002 The paper contains two main results. The first shows that the intuitionistic least number principle for \(\Pi_1\) formulas is equivalent to the intuitionistic induction scheme for \(\Pi_1\) formulas. The other result is a characterization of those linear Kripke structures which decide all \(\Delta_0\)-formulas, and in which forcing and satisfaction for
Morteza Moniri
exaly +3 more sources
Domain Adversarial Convolutional Neural Network Improves the Accuracy and Generalizability of Wearable Sleep Assessment Technology [PDF]
SensorsWearable accelerometers are widely used as an ecologically valid and scalable solution for long-term at-home sleep monitoring in both clinical research and care.
Adonay S. Nunes +5 more
doaj +2 more sources