Results 31 to 40 of about 71,669 (311)
Alternating automata and temporal logic normal forms [PDF]
We provide a translation from SNFPLTL, a normal form for propositional linear time temporal logic, into alternating automata on infinite words, and vice versa.
Dixon, C., Fisher, M., Bolotov, A.
core +1 more source
A Temporal Logic for Hyperproperties
Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore cannot express many hyperproperties of interest, including noninterference and other important properties in ...
Bernd Finkbeiner +2 more
openaire +2 more sources
Handling periodic properties: deductive verification for quantified temporal logic specifications [PDF]
We present a deductive verification technique for the specifications written in terms of quantified propositional linear-time temporal logic (QPTL). The system extends previous natural deduction constructions for the propositional linear-time temporal ...
Bolotov, A.
core +1 more source
The Temporal Logic Sugar [PDF]
Since the introduction of temporal logic for the specification of computer programs [5], usability has been an issue, because a difficult-to-use formalism is a barrier to the wide adoption of formal methods. Our solution is Sugar, the temporal logic used by the RuleBase formal verification tool [2]. Sugar adds the power of regular expressions to CTL [4]
Ilan Beer +5 more
openaire +1 more source
Certain Bounds of Formulas in Free Temporal Algebras
In this paper, we give a basic structure theorem based on the study of extreme cases for the value of ≺ (the classical precedence relation between ultrafilters), i.e., ≺=∅ and no isolated element in ≺.
Francisco Miguel García-Olmedo +2 more
doaj +1 more source
Temporal Logics for Representing Agent Communication Protocols [PDF]
This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to specify the conventions of social interaction, rather than making reference to the ...
Ulle Endriss +2 more
core +1 more source
In Proceedings EXPRESS/SOS 2020, arXiv:2008 ...
openaire +2 more sources
Formal Verification of Three-Valued Digital Waveforms
We investigate a formal verification problem (mathematically rigorous correctness checking) for digital waveforms used in practical development of digital microelectronic devices (digital circuits) at early design stages.
Nina Yu. Kutsak, Vladislav V. Podymov
doaj +1 more source
Temporal Logic as Filtering [PDF]
We show that metric temporal logic (MTL) can be viewed as linear time-invariant filtering, by interpreting addition, multiplication, and their neutral elements, over the idempotent dioid (max,min,0,1). Moreover, by interpreting these operators over the field of reals (+,×,0,1), one can associate various quantitative semantics to a metric ...
Alëna Rodionova +3 more
openaire +2 more sources
Model checking linear coalgebraic temporal logics: an automata-theoretic approach [PDF]
We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras.
Cirstea, Corina, Corina Cîrstea
core +1 more source

