Once and for all☆
Under an Elsevier user license
open archive
Highlights
► We consider the extension of branching temporal logics with past-time operators. ► We examine two possible semantics: one in which past is linear and one in which past is branching. ► For both semantics, we study their practice as specification languages and characterize their expressive power. ► We study the complexity of the model-checking and satisfiability problems for the extended logics.
Keywords
Temporal logic
Past-time operators
Expressive power
Decision procedures
Alternating automata
Cited by (0)
- ☆
The paper is based on Kupferman and Pnueli (1995) [10] and includes the solution to problems that were left open there; namely, model checking of , satisfiability of , and satisfiability of .
- 1
Amir Pnueli passed away on November 2, 2009.
Copyright © 2011 Elsevier Inc. All rights reserved.