Results 11 to 20 of about 6,826 (311)
, 2017 Since the early 1990's, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressive-ness and algorithmic results on those logics, and discuss semantic choices that ...
Bouyer, Patricia +4 more
openaire +4 more sources
Temporal Logics for Hyperproperties [PDF]
, 2014 Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL* can refer only to a single path at a time, hence cannot express many hyperproperties of interest.
Michael R. Clarkson +5 more
openaire +3 more sources
On the Expressive Power of the Normal Form for Branching-Time Temporal Logics [PDF]
, 2022 With the emerging applications that involve complex distributed systems branching-time specifications are specifically important as they reflect dynamic and non-deterministic nature of such applications.
Bolotov, Alexander
core +1 more source
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? [PDF]
Logical Methods in Computer Science, 2022 Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem. We investigate
Bartosz Bednarczyk, Stéphane Demri
doaj +1 more source
Temporal Justification Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics.
Samuel Bucheli +2 more
openaire +4 more sources
Моделирование и анализ информационных систем, 2021 Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses.
Anton Romanovich Gnatenko +1 more
doaj +1 more source
Quantales and Temporal Logics [PDF]
, 2006 We propose an algebraic semantics for the temporal logic CTL* and simplify it for its sublogics CTL and LTL. We abstractly represent state and path formulas over transition systems in Boolean left quantales. These are complete lattices with a multiplication that preserves arbitrary joins in its left argument and is isotone in its right argument.
Möller, Bernhard (Prof. Dr.) +2 more
openaire +1 more source
On the Modeling and Verification of Collective and Cooperative Systems
Frontiers in Robotics and AI, 2022 The formal description and verification of networks of cooperative and interacting agents is made difficult by the interplay of several different behavioral patterns, models of communication, scalability issues.
Alessandro Aldini
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 Formal Approach to Coercion Resistance and Its Application to E-Voting
Mathematics, 2022 The outbreak of the COVID-19 pandemic brought renewed attention to electronic voting—this time as a potential option to contain the spread during elections.
Stanislas Riou +2 more
doaj +1 more source