Time-Darts: A Data Structure for Verification of Closed Timed Automata

Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison, discretization offers an easy alternative, with all operations having linear-time complexity in the number of clocks, and yet valid for a large class of closed systems. Unfortunately, fine-grained discretization causes itself a state-space explosion. We introduce a new data structure called time-darts for the symbolic representation of state-spaces of timed automata. Compared with the complete discretization, a single time-dart allows to represent an arbitrary large set of states, yet the time complexity of operations on time-darts remain linear in the number of clocks. We prove the correctness of the suggested reachability algorithm and perform several experiments in order to compare the performance of time-darts and the complete discretization. The main conclusion is that in all our experiments the time-dart method outperforms the complete discretization and it scales significantly better for models with larger constants.

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

[2]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[3]  Dirk Beyer,et al.  Rabbit: A Tool for BDD-Based Verification of Real-Time Systems , 2003, CAV.

[4]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

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

[6]  Wang Yi,et al.  Time-abstracted Bisimulation: Implicit Specifications and Decidability , 1997, Inf. Comput..

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

[8]  Marius Bozga,et al.  IF-2.0: A Validation Environment for Component-Based Real-Time Systems , 2002, CAV.

[9]  Guoliang Zheng,et al.  A quadratic-time DBM-based successor algorithm for checking timed automata , 2005, Inf. Process. Lett..

[10]  Kim G. Larsen,et al.  opaal: A Lattice Model Checker , 2011, NASA Formal Methods.

[11]  Jun Sun,et al.  An analyzer for extended compositional process algebras , 2008, ICSE Companion '08.

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

[13]  Amir Pnueli,et al.  Data-Structures for the Verification of Timed Automata , 1997, HART.

[14]  Pao-Ann Hsiung,et al.  On the verification of Wireless Transaction Protocol using SGM and RED , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

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

[16]  Jirí Srba,et al.  TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets , 2012, TACAS.

[17]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

[18]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[19]  Stavros Tripakis,et al.  Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics , 1999, CHARME.

[20]  Dirk Beyer,et al.  Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification? , 2003, FORTE.

[21]  Leslie Lamport,et al.  Real-Time Model Checking Is Really Simple , 2005, CHARME.

[22]  Wang Yi,et al.  Time Abstracted Bisimiulation: Implicit Specifications and Decidability , 1993, MFPS.

[23]  Jirí Srba,et al.  An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata , 2009, ICFEM.