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. © 1994, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Alur, R., & Henzinger, T. A. (1994). A Really Temporal Logic. Journal of the ACM (JACM), 41(1), 181–203. https://doi.org/10.1145/174644.174651
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.