Synthesising Classic and Interval Temporal Logic

Linear-Time Temporal Logic} (LTL) is one of the most influential logics for the specification and verification of reactive systems. An important selling point of LTL is its striking simplicity, which might be a reason why none of the many extensions suggested to LTL have gained the same influence. Interval based temporal logics like \emph{Interval Temporal Logic} (ITL) are a more recent branch of temporal logics with their own niche of interesting applications. On first glance, interval based temporal logics very little resemble LTL and the spread of these logics beyond their niche is hampered by a seeming structural incompatibility with LTL. When competing for being applied on a larger scale, interval based temporal logics would fight a losing battle against a more established competitor with better complexity and mature tools. In this paper, we suggest to extend ITL to \emph{Pop Logic} (PL) by introducing a simple \emph{pop} operator that revokes the binding of the \emph{chop} operation -- very much like the popping operation in a stack -- and show that LTL can be viewed as a syntactic subset of PL. This is a surprising twist: by strengthening the comparably exotic logic ITL slightly and by using the new \emph{pop} and the old \emph{chop} operator as primitive constructs, we obtain a logic for which LTL is a de-facto syntactic fragment. The power of this extension is that it can, by subsuming both interval and classic temporal logics, synthesise both concepts to a common framework. The charm of this extension is that PL does not sacrifice the simplicity that makes its sub-logics attractive.

[1]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[2]  Li Zhang,et al.  A decision procedure for propositional projection temporal logic with infinite models , 2008, Acta Informatica.

[3]  Pierre Wolper Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[4]  Moshe Y. Vardi Branching vs. Linear Time: Final Showdown , 2001, TACAS.

[5]  Aravinda Prasad Sistla,et al.  Theoretical issues in the design and verification of distributed systems , 1983 .

[6]  Zohar Manna,et al.  A Hardware Semantics Based on Temporal Intervals , 1983, ICALP.

[7]  Benjamin Charles Moszkowski Reasoning about Digital Circuits , 1983 .

[8]  T. Schlipf,et al.  Formal verification made easy , 1997, IBM J. Res. Dev..

[9]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Zhenhua Duan,et al.  Complexity of propositional projection temporal logic with star , 2009, Math. Struct. Comput. Sci..

[11]  Bernd Finkbeiner,et al.  Coordination Logic , 2010, CSL.

[12]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[13]  Zhenhua Duan,et al.  An extended interval temporal logic and a framing technique for temporal logic programming , 1996 .

[14]  Maciej Koutny,et al.  Projection in Temporal Logic Programming , 1994, LPAR.

[15]  Zhenhua Duan,et al.  Expressiveness of propositional projection temporal logic with star , 2011, Theor. Comput. Sci..

[16]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[17]  Joseph Y. Halpern,et al.  Equations between regular terms and an application to process logic , 1981, STOC '81.

[18]  David Harel,et al.  Process Logic: Expressiveness, Decidability, Completeness , 1980, FOCS.

[19]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[20]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[21]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[22]  Ben C. Moszkowski,et al.  Compositional reasoning about projected and infinite time , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.