Decision Problems for Timed Automata: A Survey

Finite automata and regular languages have been useful in a wide variety of problems in computing, communication and control, including formal modeling and verification. Traditional automata do not admit an explicit modeling of time, and consequently, timed automata [2] were introduced as a formal notation to model the behavior of real-time systems. Timed automata accept timed languages consisting of sequences of events tagged with their occurrence times. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theoretical results concerning decision problems of reachability, language inclusion and language equivalence for timed automata and its variants, with some new proofs and comparisons. We conclude with a discussion of some open problems.

[1]  Nicolas Markey,et al.  Robustness and Implementability of Timed Automata , 2004, FORMATS/FTRTFT.

[2]  Pierre-Yves Schobbens,et al.  The Logic of Event Clocks - Decidability, Complexity and Expressiveness , 1998, J. Autom. Lang. Comb..

[3]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[4]  Patricia Bouyer,et al.  Are Timed Automata Updatable? , 2000, CAV.

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

[6]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

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

[8]  Joseph S. Miller.  Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata , 2000, HSCC.

[9]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

[10]  Stavros Tripakis,et al.  The Tool KRONOS , 1996, Hybrid Systems.

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

[12]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

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

[14]  Patricia Bouyer,et al.  Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..

[15]  Mihalis Yannakakis,et al.  Minimum and maximum delay problems in real-time systems , 1991, Formal Methods Syst. Des..

[16]  Rajeev Alur,et al.  Timing Analysis in COSPAN , 1996, Hybrid Systems.

[17]  Thomas A. Henzinger,et al.  Back to the future: towards a theory of timed regular languages , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

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

[21]  Yassine Lakhnech,et al.  Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems , 2004, Lecture Notes in Computer Science.

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

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

[24]  Deepak D'Souza.  A Logical Characterisation of Event Recording Automata , 2000, FTRTFT.

[25]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[26]  Kim G. Larsen,et al.  Staying Alive as Cheaply as Possible , 2004, HSCC.

[27]  Farn Wang,et al.  Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems , 2000, TACAS.

[28]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

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

[30]  Stavros Tripakis,et al.  Folk Theorems on the Determinization and Minimization of Timed Automata , 2003, FORMATS.

[31]  Thomas A. Henzinger,et al.  A Comparison of Control Problems for Timed and Hybrid Systems , 2002, HSCC.

[32]  Bengt Jonsson,et al.  CONCUR ’94: Concurrency Theory , 1994, Lecture Notes in Computer Science.

[33]  Thomas A. Henzinger,et al.  Hybrid Systems III , 1995, Lecture Notes in Computer Science.

[34]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[35]  Anuj Puri,et al.  Dynamical Properties of Timed Automata , 1998, Discret. Event Dyn. Syst..

[36]  Catherine Dufourd,et al.  Timed automata and additive clock constraints , 2000, Information Processing Letters.

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

[38]  P. Madhusudan,et al.  Timed Control Synthesis for External Specifications , 2002, STACS.

[39]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[40]  J. Ouaknine,et al.  On the language inclusion problem for timed automata: closing a decidability gap , 2004, LICS 2004.

[41]  Thomas A. Henzinger,et al.  The Observational Power of Clocks , 1994, CONCUR.

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

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