Universit'e de Li`ege We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, looping and repeating) for the automata. It turns out, however, that these logics all have the same expressive power and that their decision problems are all PSPACE-complete. We also investigate connectives defined by alternating automata and show that they do not increase the expressive power of the logic or the complexity of the decision problem. 1
|
1069
|
A calculus of communicating systems
– Milner
- 1980
|
|
808
|
The temporal logic of programs
– Pnueli
- 1977
|
|
600
|
Dynamic Logic
– Kozen, Harel, et al.
- 2000
|
|
460
|
P.: An automata-theoretic approach to automatic program verification
– Vardi, Wolper
- 1986
|
|
387
|
Automata on infinite objects
– Thomas
- 1990
|
|
294
|
Results on the propositional -calculus
– Kozen
- 1983
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
248
|
E.: The complexity of propositional linear temporal logic
– Sistla, Clarke
- 1985
|
|
241
|
On a decision method in restricted second order arithmetic
– Büchi
- 1962
|
|
228
|
Proving the correctness of multiprocess programs
– Lamport
- 1977
|
|
210
|
On the temporal analysis of fairness
– Gabbay, Pnueli, et al.
- 1980
|
|
176
|
On the synthesis of a reactive module
– Rosner
|
|
168
|
Automatic verification of probabilistic concurrent finite-state programs
– Vardi
- 1985
|
|
168
|
Temporal logic can be more expressive
– Wolper
- 1983
|
|
165
|
Real-time logics: complexity and expressiveness
– Alur, Henzinger
- 1990
|
|
164
|
Automata-theoretic techniques for modal logics of programs
– Vardi, Wolper
- 1986
|
|
155
|
Considerations on floyd-hoare logic
– Pratt
- 1976
|
|
141
|
Finite automata and their decision problems
– Rabin, Scott
- 1959
|
|
128
|
Synthesis of communicating processes from temporal logic specifications
– Manna, Wolper
- 1984
|
|
115
|
The glory of the past
– Lichtenstein, Pnueli, et al.
- 1985
|
|
96
|
The complementation problem for Büchi automata with applications to temporal logic
– Sistla, Vardi, et al.
- 1985
|
|
85
|
Characterizing correctness properties of parallel programs using fixpoints, International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 85
– Emerson, Clarke
- 1980
|
|
81
|
Models of program logic
– Pratt
- 1979
|
|
79
|
A.: A really abstract concurrent model and its temporal logic
– Barringer, Kuiper, et al.
- 1986
|
|
75
|
Space-bounded reducibility among combinatorial problems
– Jones
- 1975
|
|
71
|
On the complexity of !-automata
– Safra
- 1988
|
|
71
|
A temporal fixpoint calculus
– Vardi
- 1988
|
|
67
|
Testing and generating infinite sequences by a finite automaton
– McNaughton
- 1966
|
|
63
|
First Order Dynamic Logic
– Harel
- 1979
|
|
59
|
Finite Automata - Behavior and Synthesis
– Trakhtenbrot, Barzdin
- 1973
|
|
54
|
The anchored version of the temporal framework
– Manna, Pnueli
- 1989
|
|
54
|
On the Relation of Programs and Computations to Models of Temporal Logic
– Wolper
- 1989
|
|
44
|
Theories of automata on !-tapes: A simplified approach
– Choueka
- 1974
|
|
39
|
Deciding full branching time logics
– Emerson, Sistla
- 1984
|
|
35
|
Propositional dynamic logic of looping and converse is elementarily decidable
– Streett
- 1982
|
|
30
|
On Equations for Regular Languages, Finite Automata, and Sequential Networks: Theoret
– Brzozowski, Leiss
- 1980
|
|
30
|
Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time
– Muller, Saoudi, et al.
- 1988
|
|
30
|
A near-optimal method for reasoning about action
– Pratt
- 1980
|
|
27
|
Infinite sequences and finite machines
– Muller
- 1963
|
|
24
|
Decision problems for !-automata
– Landweber
- 1969
|
|
23
|
Temporal logic with fixed points
– Banieqbal, Barringer
- 1987
|
|
22
|
Yet another process logic
– Vardi, Wolper
- 1983
|
|
21
|
Weak monadic second order theory of succesor is not elementary-recursive
– Meyer
- 1974
|
|
20
|
Application of model theoretic games to discrete linear orders and finite automata
– Ladner
- 1977
|
|
20
|
On -regular sets
– Wagner
- 1979
|
|
17
|
The propositional dynamic logic of deterministic, well-structured programs
– Halpern, Reif
- 1983
|
|
17
|
A combinatorial approach to the theory of !-automata
– Thomas
- 1981
|
|
15
|
Succinct Representation of Regular Languages by Boolean automata II: Theoret
– Leiss
- 1985
|
|
11
|
A compositional temporal approach to a csp-like language
– Barringer, Kuiper, et al.
- 1985
|
|
9
|
Nondeterminism in logics of programs
– Harel, Pratt
- 1978
|
|
