Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison

Model checking is a powerful method widely explored in formal verification to check the (state-transition) model of a system against desired properties of its behaviour. Classically, properties are expressed by formulas of a temporal logic, such as LTL, CTL, and CTL*. These logics are "point-wise" interpreted, as they describe how the system evolves state-by-state. On the contrary, Halpern and Shoham's interval temporal logic (HS) is "interval-wise" interpreted, thus allowing one to naturally express properties of computation stretches, spanning a sequence of states, or properties involving temporal aggregations, which are inherently "interval-based". In this paper, we study the expressiveness of HS in model checking, in comparison with that of the standard logics LTL, CTL, and CTL*. To this end, we consider HS endowed with three semantic variants: the state-based semantics, introduced by Montanari et al., which allows branching in the past and in the future, the linear-past semantics, allowing branching only in the future, and the linear semantics, disallowing branching. These variants are compared, as for their expressiveness, among themselves and to standard temporal logics, getting a complete picture. In particular, HS with linear (resp., linear-past) semantics is proved to be equivalent to LTL (resp., finitary CTL*).

[1]  Davide Bresolin,et al.  Tableau-based decision procedures for the logics of subinterval structures over dense orderings , 2008 .

[2]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

[3]  Davide Bresolin,et al.  The dark side of interval temporal logic: marking the undecidability border , 2013, Annals of Mathematics and Artificial Intelligence.

[4]  Davide Bresolin,et al.  Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions , 2009, Ann. Pure Appl. Log..

[5]  Angelo Montanari,et al.  An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions , 2017, SEFM.

[6]  Peter Roper,et al.  Intervals and tenses , 1980, J. Philos. Log..

[7]  Angelo Montanari,et al.  On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions , 2017, GandALF.

[8]  Gabriele Puppis,et al.  A decidable weakening of Compass Logic based on cone-shaped cardinal directions , 2015, Log. Methods Comput. Sci..

[9]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[10]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[11]  Alessio Lomuscio,et al.  An Epistemic Halpern-Shoham Logic , 2013, IJCAI.

[12]  Angelo Montanari,et al.  Interval vs. Point Temporal Logic Model Checking , 2017, ACM Trans. Comput. Log..

[13]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[14]  Angelo Montanari,et al.  Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS , 2015, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME).

[15]  Jakub Michaliszyn,et al.  The Undecidability of the Logic of Subintervals , 2014, Fundam. Informaticae.

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

[17]  Angelo Montanari,et al.  Model Checking Well-Behaved Fragments of HS: The (Almost) Final Picture , 2016, KR.

[18]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[19]  E. Emerson,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, ACM-SIGACT Symposium on Principles of Programming Languages.

[20]  Angelo Montanari,et al.  Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments , 2016, IJCAR.

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

[22]  Amir Pnueli,et al.  Propositional Temporal Logics: Decidability and Completeness , 2000, Log. J. IGPL.

[23]  Angelo Montanari,et al.  Checking interval properties of computations , 2014, Acta Informatica.

[24]  Angelo Montanari,et al.  Model Checking the Logic of Allen's Relations Meets and Started-by is PNP-Complete , 2016, GandALF.

[25]  Alessio Lomuscio,et al.  Decidability of model checking multi-agent systems against a class of EHS specifications , 2014, ECAI.

[26]  Pavol Cerný,et al.  Preserving Secrecy Under Refinement , 2006, ICALP.

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

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

[29]  Amir Pnueli,et al.  Once and for all , 1995, J. Comput. Syst. Sci..

[30]  Kamal Lodaya,et al.  Sharpening the Undecidability of Interval Temporal Logic , 2000, ASIAN.

[31]  Angelo Montanari,et al.  A Model Checking Procedure for Interval Temporal Logics based on Track Representatives , 2015, CSL.

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

[33]  Patrick Blackburn,et al.  Hybrid languages , 1995, J. Log. Lang. Inf..

[34]  Ian Pratt-Hartmann,et al.  Temporal prepositions and their logic , 2004, Artif. Intell..

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

[36]  Davide Bresolin,et al.  Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders , 2011, TABLEAUX.

[37]  Giuseppe De Giacomo,et al.  Linear Temporal Logic and Linear Dynamic Logic on Finite Traces , 2013, IJCAI.

[38]  Alessio Lomuscio,et al.  Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions , 2016, KR.

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