Forward Analysis of Updatable Timed Automata

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it suffers from a state explosion and is thus not used in practice. Instead, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial configurations does not always terminate. Thus, some abstractions are often used to ensure termination, among which, a widening operator on zones.In this paper, we study in detail this widening operator and the corresponding forward analysis algorithm. This algorithm is most used and implemented in tools like KRONOS and UPPAAL. One of our main results is that it is hopeless to find a forward analysis algorithm for general timed automata, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in detail this algorithm in the more general framework of updatable timed automata, a model which has been introduced as a natural syntactic extension of classical timed automata. We describe subclasses of this model for which a correct widening operator can be found.

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

[2]  Antoine Petit,et al.  Analysing the PGM protocol with UPPAAL , 2004 .

[3]  Patricia Bouyer,et al.  Expressiveness of Updatable Timed Automata , 2000, MFCS.

[4]  Stavros Tripakis,et al.  On-the-fly symbolic model checking for real-time systems , 1997, Proceedings Real-Time Systems Symposium.

[5]  Christian Choffrut,et al.  Timed Automata with Periodic Clock Constraints , 2000, J. Autom. Lang. Comb..

[6]  Wang Yi,et al.  Efficient Timed Reachability Analysis Using Clock Difference Diagrams , 1998, CAV.

[7]  Stavros Tripakis,et al.  L'analyse formelle des systèmes temporisés en pratique. (The Formal Analysis of Timed Systems in Practice) , 1998 .

[8]  Wieslaw Zielonka,et al.  Controlled Timed Automata , 1998, CONCUR.

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

[10]  Stavros Tripakis,et al.  Verification of the fast reservation protocol with delayed transmission using the tool KRONOS , 1998, Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245).

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

[12]  Patricia Bouyer,et al.  Untameable Timed Automata! , 2003, STACS.

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

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

[15]  Laurent Fribourg,et al.  Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol , 1999, CAV.

[16]  Stavros Tripakis,et al.  Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..

[17]  Nicolas Halbwachs,et al.  An implementation of three algorithms for timing verification based on automata emptiness , 1992, [1992] Proceedings Real-Time Systems Symposium.

[18]  Rajeev Alur,et al.  Timed Automata , 1999, CAV.

[19]  Howard Wong-Toi,et al.  Symbolic approximations for verifying real-time systems , 1995 .

[20]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[21]  Thomas A. Henzinger,et al.  HYTECH: A Model Checker for Hybrid Systems , 1997, CAV.

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

[23]  Johan Bengtsson,et al.  Clocks, DBMS and States in Timed Systems , 2002 .

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

[25]  Sergio Yovine,et al.  Model Checking Timed Automata , 1996, European Educational Forum: School on Embedded Systems.

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

[27]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[28]  Supratik Mukhopadhyay,et al.  Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata , 1999, FSTTCS.

[29]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[30]  Thomas A. Henzinger,et al.  The Expressive Power of Clocks , 1995, ICALP.

[31]  David Lee,et al.  An Efficient Algorithm for Minimizing Real-Time Transition Systems , 1997, Formal Methods Syst. Des..

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

[33]  Stavros Tripakis,et al.  Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.

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

[35]  Kim G. Larsen,et al.  Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL , 1997, Proceedings Real-Time Systems Symposium.

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