Timed Automata May Cause Some Troubles

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 does not support a natural implementation and, in practice, 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 details this widening operator and the forward analysis algorithm that uses it. 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, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in details 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]  Howard Wong-Toi,et al.  Symbolic approximations for verifying real-time systems , 1995 .

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

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

[4]  Margarita V. Korovina,et al.  Fixed points on abstract structures without the equality test , 2002, FICS.

[5]  Rajeev Alur,et al.  Minimization of Timed Transition Systems , 1992, CONCUR.

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

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

[8]  Olivier Danvy,et al.  Lambda-Lifting in Quadratic Time , 2002, J. Funct. Log. Program..

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

[10]  Rasmus Pagh,et al.  Simulating Uniform Hashing in Constant Time and Optimal Space , 2002 .

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

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

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

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

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

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

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

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

[19]  Olivier Danvy,et al.  On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation , 2002, ASIA-PEPM '02.

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

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

[22]  Olivier Danvy,et al.  Memoization in Type-Directed Partial Evaluation , 2002, GPCE.

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

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

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

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

[27]  Paulo Oliva,et al.  Proof Mining: A Systematic Way of Analysing Proofs in Mathematics , 2002 .

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

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

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

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

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

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

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

[35]  Christian N. S. Pedersen,et al.  Comparative Methods for Gene Structure Prediction in Homologous Sequences , 2002, WABI.

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

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

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

[39]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[40]  Ulrich Kohlenbach,et al.  Mann iterates of directionally nonexpansive mappings in hyperbolic spaces , 2002 .