Model Checking Well-Behaved Fragments of HS: The (Almost) Final Picture

Model checking is one of the most powerful and widespread tools for system verification with applications in many areas of computer science and artificial intelligence. The large majority of model checkers deal with properties expressed in point-based temporal logics, such as LTL and CTL. However, there exist relevant properties of systems which are inherently interval-based. Model checking algorithms for interval temporal logics (ITLs) have recently been proposed to check interval properties of computations. As the model checking problem for full Halpern and Shoham's ITL (HS for short) turns out to be decidable, but computationally heavy, research has focused on its well-behaved fragments. In this paper, we provide an almost final picture of the computational complexity of model checking for HS fragments with modalities for (a subset of) Allen's relations meets, met by, starts, and ends.

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

[2]  Alessio Lomuscio,et al.  Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions , 2015, ArXiv.

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

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

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

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

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

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

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

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

[11]  Michael R. Hansen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris) , 2004 .

[12]  Georg Gottlob.  NP trees and Carnap's modal logic , 1995, JACM.

[13]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

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

[15]  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).

[16]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for Multi-agent Systems , 2006, TACAS.

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

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

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

[20]  Fausto Giunchiglia,et al.  Planning as Model Checking , 1999, ECP.

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

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

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

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

[25]  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.

[26]  Philippe Schnoebelen,et al.  Oracle Circuits for Branching-Time Model Checking , 2003, ICALP.

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

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

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