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 Introduction For many years, logics of programs have been tools for reasoning about the input/output behavior of programs. When dealing with concurrent or nonterminating processes (like operating systems) there is, however, a need to reason about infinite computations. Thus, instead of considering the first and last states of finite computations, we need to consider the infinite sequences of states that the program goes through...
|
1077
|
A Calculus for Communication Systems
– Milner
- 1980
|
|
814
|
The temporal logic of programs
– Pnueli
- 1977
|
|
641
|
Dynamic Logic
– Harel
- 1984
|
|
453
|
and P.Wolper. An Automata-Theoretic approach to Automatic Program Verification
– Vardi
- 1986
|
|
389
|
Automata on infinite objects
– Thomas
- 1990
|
|
264
|
Results on the propositional -calculus
– Kozen
- 1983
|
|
260
|
The propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
241
|
On a decision method in restricted second order arithmetic
– Büchi
- 1962
|
|
238
|
The complexity of propositional linear temporal logics
– Sistla, Clarke
- 1985
|
|
225
|
Proving the correctness of multiprocess programs
– Lamport
- 1977
|
|
196
|
On the temporal analysis of fairness
– Gabbay, Pnueli, et al.
- 1980
|
|
193
|
On the synthesis of a reactive module
– Pnueli, Rosner
- 1989
|
|
170
|
Automatic verification of probabilistic concurrent finite-state programs
– Vardi
- 1987
|
|
168
|
Automata-theoretic techniques for modal logic of programs
– Vardi, Wolper
- 1986
|
|
164
|
Semantical considerations on Floyd-Hoare logic
– Pratt
- 1976
|
|
162
|
Real-time logics: Complexity and expressiveness
– Alur, Henzinger
- 1990
|
|
161
|
Temporal Logic can be more expressive
– Wolper
- 1983
|
|
140
|
Finite automata and their decision problems
– Rabin, Scott
- 1959
|
|
132
|
Synthesis of communicating processes from temporal logic speci
– Manna, Pnueli
- 1984
|
|
104
|
The glory of the past
– Lichtenstein, Pnueli, et al.
- 1985
|
|
97
|
The Complementation Problem for Buchi Automata with Applications to Temporal Logic
– Sistla, Vardi, et al.
- 1987
|
|
88
|
Characterizing correctness properties of parallel programs using
– Emerson, Clarke
- 1980
|
|
76
|
Models of program logics
– Pratt
- 1979
|
|
71
|
A really abstract concurrent model and its temporal logic
– Barringer, Kuiper, et al.
- 1986
|
|
68
|
On the complexity of !-automata
– Safra
- 1988
|
|
67
|
Testing and generating infinite sequences by a finite automaton
– McNaughton
- 1966
|
|
66
|
Space-bounded reducibility among combinatorial problems
– Jones
- 1975
|
|
66
|
A temporal fixpoint calculus
– Vardi
- 1988
|
|
60
|
Finite Automata: Behavior and Synthesis
– Barzdin'
- 1973
|
|
58
|
First Order Dynamic Logic
– Harel
- 1979
|
|
50
|
The anchored ver- sion of the temporal framework
– Manna, Pnueli
- 1989
|
|
48
|
On the Relations of Programs and Computations to Models of Temporal Logic
– Wolper
- 1989
|
|
39
|
Deciding Full Branching Time Logic
– Emerson, Sistla
- 1984
|
|
37
|
Theories of automata on !-tapes: a simplified approach
– Choueka
- 1974
|
|
34
|
Propositional Dynamic Logic of Looping and Converse is Elementary Decidable
– Streett
- 1982
|
|
33
|
A near-optimal method for reasoning about action
– Pratt
- 1980
|
|
31
|
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
|
On equations for regular languages, finite automata and sequential networks
– Brzozowski, Leiss
- 1980
|
|
28
|
Infinite sequences on finite machines
– Muller
- 1963
|
|
26
|
Decision problems for !-automata
– Landweber
|
|
23
|
Weak monadic second order theory of successor is not elementary recursive
– Meyer
- 1975
|
|
22
|
Temporal logic with fixed points
– Banieqbal, Barringer
- 1987
|
|
22
|
Application of model theoretic games to discrete linear orders and finite automata
– Ladner
- 1977
|
|
21
|
Yet another process logic
– Vardi, Wolper
- 1983
|
|
18
|
On !-regular sets
– Wagner
- 1979
|
|
16
|
The propositional dynamic logic of deterministic, well-structured programs
– Halpern, Reif
- 1983
|
|
16
|
A combinatorial approach to the theory of !-automata
– Thomas
- 1981
|
|
13
|
Succinct representation of regular languages by Boolean automata
– Leiss
- 1985
|
|
10
|
A compositional temporal approach to a csp-like language
– Barringer, Kuiper, et al.
- 1985
|
|
8
|
Nondeterminism in logics of programs
– Harel, Pratt
- 1978
|
