A really temporal logic
Rajeev Alur, Thomas A. Henzinger · Annual Symposium on Foundations of Computer Science · 1989
A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.>
Cited by 162 works. doi:10.1109/sfcs.1989.63473
Authors
References
- Introduction to automata theory, languages and computation
- Introduction to automata theory, languages, and computation
- The temporal logic of programs
- Proving Liveness Properties of Concurrent Programs
- Propositional dynamic logic of regular programs
- The complexity of propositional linear temporal logics
- Safety analysis of timing properties in real-time systems
- Checking that finite state concurrent programs satisfy their linear specification
- Using branching time temporal logic to synthesize synchronization skeletons
- Temporal logic can be more expressive