An Introduction to Timed Automata

We introduce timed automata and show how they can be used for the specification of timed systems. We also present some syntactical extensions useful for modeling and in particular networks of timed automata. Then we present two techniques for the analysis of timed automata: the zone graph and the region graph. The former can be more efficient for reachability analysis and related problems but it is not always finite. In contrast, the latter is a finite graph and can be used for model-checking. We compare the properties fulfilled by finite automata and timed automata emphasizing their main differences: languages of timed automata are not closed under complementation and the inclusion of languages is undecidable for timed automata.

[1]  Olivier Finkel,et al.  Undecidable Problems About Timed Automata , 2006, FORMATS.

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

[3]  Christel Baier,et al.  When Are Timed Automata Determinizable? , 2009, ICALP.

[4]  Paul Gastin,et al.  Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.

[5]  Joseph Sifakis,et al.  Compositional Specification of Timed Systems (Extended Abstract) , 1996, STACS.

[6]  Shankara Narayanan Krishna,et al.  Timed Automata with Integer Resets: Language Inclusion and Expressiveness , 2008, FORMATS.

[7]  Eugene Asarin.  Challenges in Timed Languages: from applied theory to basic theory (Column: Concurrency) , 2004, Bull. EATCS.

[8]  Kim Guldstrand Larsen,et al.  The power of reachability testing for timed automata , 2003, Theor. Comput. Sci..

[9]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

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

[11]  Thomas A. Henzinger,et al.  A Determinizable Class of Timed Automata , 1994, CAV.

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

[13]  Joël Ouaknine,et al.  Undecidability of Universality for Timed Automata with Minimal Resources , 2007, FORMATS.

[14]  Patricia Bouyer,et al.  Undecidability Results for Timed Automata with Silent Transitions , 2009, Fundam. Informaticae.

[15]  Patricia Bouyer,et al.  On Conciseness of Extensions of Timed Automata , 2005, J. Autom. Lang. Comb..

[16]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[17]  Slawomir Lasota,et al.  Alternating timed automata , 2008, TOCL.

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

[19]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[20]  Kim G. Larsen,et al.  CMC: A Tool for Compositional Model-Checking of Real-Time Systems , 1998, FORTE.

[21]  Rajeev Alur,et al.  Decision Problems for Timed Automata: A Survey , 2004, SFM.

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

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