Checking interval properties of computations

Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by checking the formula against the model. Classically, system behaviour is expressed by a formula of a temporal logic, such as LTL and the like. These logics are “point-wise” interpreted, as they describe how the system evolves state-by-state. However, there are relevant properties, such as those constraining the temporal relations between pairs of temporally extended events or involving temporal aggregations, which are inherently “interval-based”, and thus asking for an interval temporal logic. In this paper, we give a formalization of the model checking problem in an interval logic setting. First, we provide an interpretation of formulas of Halpern and Shoham’s interval temporal logic HS over finite Kripke structures, which allows one to check interval properties of computations. Then, we prove that the model checking problem for HS against finite Kripke structures is decidable by a suitable small model theorem, and we provide a lower bound to its computational complexity.

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

[2]  Valentin Goranko,et al.  A Road Map of Interval Temporal Logics and Duration Calculi , 2004, J. Appl. Non Class. Logics.

[3]  Stephan Merz,et al.  Model Checking , 2000 .

[4]  Valentin Goranko,et al.  Interval Temporal Logics: a Journey , 2013, Bull. EATCS.

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

[6]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

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

[8]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

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

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

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

[12]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[13]  Davide Bresolin,et al.  What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[14]  Fan Jing,et al.  Appendix Proof of Lemma 1 : , 2013 .

[15]  Martin Lange,et al.  Model checking propositional dynamic logic with all extras , 2006, J. Appl. Log..

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

[17]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[18]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[19]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

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

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

[22]  Gabriele Puppis,et al.  Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals , 2010, ICALP.

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

[24]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[25]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[26]  Angelo Montanari,et al.  Checking Interval Properties of Computations , 2014, TIME.

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

[28]  Davide Bresolin,et al.  Tableaux for Logics of Subinterval Structures over Dense Orderings , 2010, J. Log. Comput..

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

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

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