# Reasoning About Infinite Computations

@article{Vardi1994ReasoningAI, title={Reasoning About Infinite Computations}, author={Moshe Y. Vardi and Pierre Wolper}, journal={Inf. Comput.}, year={1994}, volume={115}, pages={1-37} }

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…

## 886 Citations

### Alternating Automata: Checking Truth and Validity for Temporal Logics

- Computer Science
- 1998

The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of truth and validity checking and yield clean and essentially optimal algorithms for both problems.

### Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics

- Computer ScienceCADE
- 1997

The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of truth and validity checking and yield clean and essentially optimal algorithms for both problems.

### Automata Theory and Model Checking

- Computer ScienceHandbook of Model Checking
- 2018

The different classes of automata are compared in terms of expressive power and succinctness, and decision problems for them are described, and the automata-theoretic approach to system specification and verification is described.

### Automata: from logics to algorithms

- Computer ScienceLogic and Automata
- 2008

Translations from five different logics are reviewed, in a unified framework, into appropriate models of finite-state automata on infinite words or infinite trees, and optimal complexity bounds for satisfiability, conformance, and realizability are obtained for all logics.

### Alternating Automata and Program Verification

- Computer ScienceComputer Science Today
- 1995

The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of finite-state-program verification and yield clear and general verification algorithms.

### Specification and Verification using Temporal Logics

- Computer ScienceModern Applications of Automata Theory
- 2012

This chapter illustrates two aspects of automata theory related to linear-time temporal logic LTL used for the verification of computer systems. First, we present a translation from LTL formulae to…

### An automata-theoretic approach to constraint LTL

- Computer Science, MathematicsInf. Comput.
- 2002

### Constructing Automata from Temporal Logic Formulas: A Tutorial

- Computer ScienceEuropean Educational Forum: School on Formal Methods and Performance Analysis
- 2000

This paper presents a tutorial introduction to the construction of finite-automata on infinite words from linear-time temporal logic formulas, and describes a first construction whose correctness is quite direct to establish, but whose behavior is always equal to the worst-case upper bound.

### Integrate Action Formalisms into Linear Temporal Description Logics

- Computer Science, Philosophy
- 2009

This paper abstracts from the actual execution sequences of a non-terminating program by considering infinite sequences of actions defined by a Büchi automaton, and assumes that the logic underlying the action formalism is a decidable description logic rather than full first-order predicate logic.

## References

SHOWING 1-10 OF 54 REFERENCES

### Automata-Theoretic Techniques for Modal Logics of Programs

- Computer ScienceJ. Comput. Syst. Sci.
- 1986

### Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time

- Computer Science[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
- 1988

The authors give a very simple uniform explanation of the persistence of exponential decidability and characterize the weak monadic theory of the tree; it turns out that weak alternating automata greatly simplify design procedures.

### Propositional Dynamic Logic of Regular Programs

- Computer Science, PhilosophyJ. Comput. Syst. Sci.
- 1979

### The Complementation Problem for Büchi Automata with Appplications to Temporal Logic

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 1987

### Finite Automata and Their Decision Problems

- Computer ScienceIBM J. Res. Dev.
- 1959

Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.

### Automatic verification of probabilistic concurrent finite state programs

- Computer Science26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
- 1985

An automata-theoretic approach is described, whereby probabilistic quantification over sets of computations is reduced to standard quantificationover individual computations, and a new determinization construction for ω-automata is used to improve the time complexity of the algorithm by two exponentials.