Results 31 to 40 of about 1,696,138 (202)
LTL-Specification of Counter Machines
Моделирование и анализ информационных систем, 2021 The article is written in support of the educational discipline “Non-classical logics”. Within the framework of this discipline, the objects of study are the basic principles and constructive elements, with the help of which the formal construction of ...
Egor V. Kuzmin
doaj +1 more source
Bisimulations for Temporal Logic
Journal of Logic, Language and Information, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kurtonina, N., de Rijke, M.
openaire +3 more sources
On the Expressive Power of Some Extensions of Linear Temporal Logic
Моделирование и анализ информационных систем, 2018 One of the most simple models of computation which is suitable for representation of reactive systems behaviour is a finite state transducer which operates over an input alphabet of control signals and an output alphabet of basic actions.
Anton Gnatenko, Vladimir Zakharov
doaj +1 more source
A decidable weakening of Compass Logic based on cone-shaped cardinal directions [PDF]
Logical Methods in Computer Science, 2015 We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four cone-shaped cardinal
Angelo Montanari +2 more
doaj +1 more source
A First-Order Complete Temporal Logic for Structured Context-Free Languages [PDF]
Logical Methods in Computer Science, 2022 The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL.
Michele Chiari +2 more
doaj +1 more source
Substructure Temporal Logic [PDF]
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013 In formal verification and design, reasoning about substructures is a crucial aspect for several fundamental problems, whose solution often requires to select a portion of the model of interest on which to verify a specific property. In this paper, we present a new branching-time temporal logic, called Substructure Temporal Logic (STL, for short ...
BENERECETTI, MASSIMO +2 more
openaire +2 more sources
Grounding Stream Reasoning Research [PDF]
Transactions on Graph Data and KnowledgeIn the last decade, there has been a growing interest in applying AI technologies to implement complex data analytics over data streams. To this end, researchers in various fields have been organising a yearly event called the "Stream Reasoning Workshop"
Bonte, Pieter +14 more
doaj +1 more source
Logical Methods in Computer Science, 2013 This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and
François Laroussinie +2 more
doaj +1 more source
Temporal Logics with Language Parameters [PDF]
Information and Computation, 2021 Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple regular properties like "Every other index is labelled a cannot be expressed in these logics. While many extensions were
Jens Oliver Gutsfeld +2 more
openaire +4 more sources
Lietuvos Matematikos Rinkinys, 2013 We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”. The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis +1 more
doaj +1 more source