Once and for all

https://doi.org/10.1016/j.jcss.2011.08.006Get rights and content
Under an Elsevier user license
open archive

Abstract

It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators. Two possible views regarding the nature of past in a branching-time model induce two different such extensions. In the first view, past is branching and each moment in time may have several possible futures and several possible pasts. In the second view, past is linear and each moment in time may have several possible futures and a unique past. Both views assume that past is finite. We discuss the practice of these extensions as specification languages, characterize their expressive power, and examine the complexity of their model-checking and satisfiability problems.

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 CTLlp, satisfiability of CTLlp, and satisfiability of CTLbp.

1

Amir Pnueli passed away on November 2, 2009.