Separation - Past, Present, and Future

Separation is a remarkable concept, invented by Dov Gabbay in [Gabbay, 1981a], and elaborated in [Gabbay, 1989; Gabbay et al., 1994]. Roughly, a temporal logic has the separation property if its formulas can be equivalently rewritten as a boolean combination of formulas, each of which depends only on the past, present, or future. This seemingly innocent and technical definition has had some far-reaching consequences, and has taken on a life of its own. Surprisingly, separation is closely connected to the important topic of expressive completeness, and is one of the main methods for proving expressive completeness. Separation has applications in executable temporal logic, and parts of this have been implemented. Separation has found recent uses in simplifying normal form theorems and axiomatising Ockhamist branching time logic, and in analysing the W3C language XPath.

[1]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[2]  Igor Walukiewicz A Complete Deductive System for the-Calculus , 1995, LICS 1995.

[3]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[4]  Howard Bowman,et al.  Mexitl: Multimedia in Executable Interval Temporal Logic , 2003, Formal Methods Syst. Des..

[5]  Alberto Zanardo,et al.  Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL , 1993, J. Log. Comput..

[6]  Dov M. Gabbay,et al.  Preservation of Expressive Completeness in Temporal Models , 1987, Inf. Comput..

[7]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[8]  20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings , 2005, LICS.

[9]  Philippe Schnoebelen,et al.  Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[10]  Holger Schlingloff Expressive completeness of temporal logic of trees , 1992, J. Appl. Non Class. Logics.

[11]  Amihood Amir Separation in Nonlinear Time Models , 1985, Inf. Control..

[12]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[13]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[14]  Kousha Etessami,et al.  An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic , 2000, Inf. Comput..

[15]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[16]  Marcelo Finger,et al.  Metatem at work: modelling reactive systems using executable temporal logic , 1993 .

[17]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[18]  D. Gabbay An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames , 1981 .

[19]  Thomas Wilke,et al.  Classifying Discrete Temporal Properties , 1999, STACS.

[20]  Catholijn M. Jonker,et al.  A temporal modelling environment for internally grounded beliefs, desires and intentions , 2003, Cognitive Systems Research.

[21]  D. Gabbay Expressive Functional Completeness in Tense Logic (Preliminary report) , 1981 .

[22]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[23]  Mark Reynolds,et al.  An axiomatization of full Computation Tree Logic , 2001, Journal of Symbolic Logic.

[24]  Mark Reynolds,et al.  An axiomatization of PCTL* , 2005, Inf. Comput..

[25]  Maarten Marx,et al.  Conditional XPath, the first order complete XPath dialect , 2004, PODS.

[26]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[27]  Roope Koivola Axiomatising Extended Computation Tree Logic , 1996 .

[28]  Roope Kaivola Axiomatising Extended Computation Tree Logic , 1996, CAAP.

[29]  Amihood Amir Expressive Completeness Failure in Branching Time Structures , 1987, J. Comput. Syst. Sci..

[30]  STACS 94 , 1994, Lecture Notes in Computer Science.

[31]  Moshe Y. Vardi Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.

[32]  Mark Reynolds More Past Glories , 2000, LICS 2000.

[33]  Philippe Schnoebelen,et al.  A Hierarchy of Temporal Logics with Past , 1995, Theor. Comput. Sci..

[34]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[35]  François Laroussinie,et al.  Specification in CTL+Past for Verification in CTL , 1999, Inf. Comput..

[36]  Philippe Schnoebelen,et al.  The Complexity of Temporal Logic Model Checking , 2002, Advances in Modal Logic.

[37]  Amir Pnueli,et al.  Complete Proof System for QPTL , 2002, J. Log. Comput..