Logic in Computer Science (LICS 1995)

Paper: Once and For All (at LICS 1995)

Authors: Orna Kupferman Amir Pnueli

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.

BibTeX

  @InProceedings{KupfermanPnueli-OnceandForAll,
    author = 	 {Orna Kupferman and Amir Pnueli},
    title = 	 {Once and For All},
    booktitle =  {Proceedings of the Tenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1995},
    year =	 1995,
    editor =	 {Dexter Kozen},
    month =	 {June}, 
    pages =      {25-35},
    location =   {San Diego, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }