## A Really Temporal Logic (1989)

### Download From

IEEE### Download Links

- [www-cad.eecs.berkeley.edu]
- [www-cad.eecs.berkeley.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of the ACM |

Citations: | 238 - 26 self |

### BibTeX

@INPROCEEDINGS{Alur89areally,

author = {Rajeev Alur and Thomas A. Henzinger},

title = {A Really Temporal Logic},

booktitle = {Journal of the ACM},

year = {1989},

pages = {164--169},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable. 1 Introduction Linear temporal logic is a widely accepted language for specifying properties of reactive systems and their behavior over time [Pnu77, OL82, MP92]. The tableau-based satisfiability algorithm for its propositional version, PTL, forms the basis for the automatic verification and synthesis of finite-state systems [LP84, MW84]. PTL is interpreted over models that abstract away from the actual times at which events occur, retaining only temporal ordering information about the states of a system. The a...