Towards a Theory of Time-Bounded Verification

We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue that this theory is both pertinent, in that it is fully adequate to handle a large proportion of 'real-world' real-time systems and specifications; and effective, in that the restriction to bounded time domains reclaims as decidable several of the key decision problems of unbounded real-time verification. Finally, we discuss several directions of ongoing and future work.

[1]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[2]  Thomas A. Henzinger,et al.  What Good Are Digital Clocks? , 1992, ICALP.

[3]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[4]  Joost-Pieter Katoen,et al.  Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability , 2005, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[5]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[6]  Joël Ouaknine,et al.  On the language inclusion problem for timed automata: closing a decidability gap , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[7]  Thomas Wilke,et al.  Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem , 1999, ICALP.

[8]  Joël Ouaknine,et al.  Digitisation and Full Abstraction for Dense-Time Model Checking , 2002, TACAS.

[9]  Paul Caspi,et al.  Timed regular expressions , 2002, JACM.

[10]  Pierre-Yves Schobbens,et al.  The Regular Real-Time Languages , 1998, ICALP.

[11]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[12]  Joost-Pieter Katoen,et al.  A Probabilistic Extension of UML Statecharts , 2002, FTRTFT.

[13]  Robert K. Brayton,et al.  Verifying Abstractions of Timed Systems , 1996, CONCUR.

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

[15]  Oded Maler,et al.  Hybrid and Real-Time Systems , 1997 .

[16]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[17]  Joël Ouaknine,et al.  Time-Bounded Verification , 2009, CONCUR.

[18]  Saharon Shelah,et al.  On the Temporal Basis of Fairness. , 1980 .

[19]  Thomas Wilke,et al.  Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata , 1994, FTRTFT.

[20]  Christof Löding,et al.  Alternating Automata and Logics over Infinite Words , 2000, IFIP TCS.

[21]  Rajeev Alur,et al.  Perturbed Timed Automata , 2005, HSCC.

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

[23]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[24]  Moshe Y. Vardi.  From Philosophical to Industrial Logics , 2009, ICLA.

[25]  Nancy A. Lynch,et al.  Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[26]  Philippe Herrmann,et al.  Timed Automata and Recognizability , 1998, Inf. Process. Lett..

[27]  Joël Ouaknine,et al.  Universality and Language Inclusion for Open and Closed Timed Automata , 2003, HSCC.

[28]  Yoram Hirshfeld,et al.  Expressiveness of Metric Modalities for Continuous Time , 2006, CSR.

[29]  Vlad Rusu,et al.  Verifying Time-bounded Properties for ELECTRE Reactive Programs with Stopwatch Automata , 1994, Hybrid Systems.

[30]  Joël Ouaknine,et al.  Safety Metric Temporal Logic Is Fully Decidable , 2006, TACAS.

[31]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[32]  Sundar Sarukkai,et al.  FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.

[33]  Nancy A. Lynch,et al.  Using mappings to prove timing properties , 1990, PODC '90.

[34]  Rupak Majumdar,et al.  Decision Problems for the Verification of Real-Time Software , 2006, HSCC.

[35]  Joël Ouaknine,et al.  On Expressiveness and Complexity in Real-Time Model Checking , 2008, ICALP.

[36]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[37]  Orna Kupferman,et al.  Weak alternating automata are not that weak , 2001, TOCL.

[38]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[39]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[40]  Thomas A. Henzinger,et al.  Robust Timed Automata , 1997, HART.

[41]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[42]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[43]  Jan van Leeuwen,et al.  Computer Science Today , 1995, Lecture Notes in Computer Science.

[44]  Panos J. Antsaklis,et al.  Hybrid Systems II , 1994, Lecture Notes in Computer Science.

[45]  Joël Ouaknine,et al.  The Cost of Punctuality , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[46]  Mario Bravetti,et al.  CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings , 2009, CONCUR.

[47]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[48]  Joël Ouaknine,et al.  Revisiting digitization, robustness, and decidability for timed automata , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[49]  Christel Baier,et al.  Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes , 2005, TACAS.

[50]  Takayasu Ito,et al.  Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics , 2001, Lecture Notes in Computer Science.

[51]  E. Emerson,et al.  Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.

[52]  Patricia Bouyer,et al.  On the Expressiveness of TPTL and MTL , 2005, FSTTCS.

[53]  Thomas A. Henzinger,et al.  The temporal specification and verification of real-time systems , 1991 .

[54]  Moshe Y. Vardi.  Alternating Automata and Program Verification , 1995, Computer Science Today.

[55]  Joël Ouaknine,et al.  On the decidability of metric temporal logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[56]  Yoram Hirshfeld,et al.  Logics for Real Time: Decidability and Complexity , 2004, Fundam. Informaticae.

[57]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[58]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings , 1992 .

[59]  Boris A. Trakhtenbrot.  Origins and metamorphoses of the Trinity: logic, nets, automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[60]  Wa Halang,et al.  REAL-TIME SYSTEMS .2. , 1989 .

[61]  Dragan Bošnački,et al.  Digitization of Timed Automata , 1999 .

[62]  Slawomir Lasota,et al.  Alternating timed automata , 2005, TOCL.

[63]  Joël Ouaknine,et al.  Alternating Timed Automata over Bounded Time , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[64]  Joël Ouaknine,et al.  On the decidability and complexity of Metric Temporal Logic over finite words , 2007, Log. Methods Comput. Sci..

[65]  Thomas A. Henzinger,et al.  Event-Clock Automata: A Determinizable Class of Timed Automata , 1999, Theor. Comput. Sci..

[66]  Pierre-Yves Schobbens,et al.  State Clock Logic: A Decidable Real-Time Logic , 1997, HART.