## Reasoning about Infinite Computations (1994)

Venue: | Information and Computation |

Citations: | 250 - 55 self |

### BibTeX

@ARTICLE{Vardi94reasoningabout,

author = {Moshe Y. Vardi and Pierre Wolper},

title = {Reasoning about Infinite Computations},

journal = {Information and Computation},

year = {1994},

volume = {115},

pages = {1--37}

}

### Years of Citing Articles

### OpenURL

### Abstract

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...