A quadratic-time DBM-based successor algorithm for checking timed automata

Most of the timed automaton model checking algorithms explore state spaces by enumeration of time zones. The data structure called Difference Bound Matrix (DBM) is widely adopted to represent time zones because of its efficiency and simplicity. In this paper, we first present a quadratic-time algorithm to compute the canonical form of the conjunction of a canonical DBM and a time guard or a location invariant. Based on this algorithm, we present a quadratic-time DBM-based successor algorithm for timed automaton model checking.

[1]  Wang Yi,et al.  UPPAAL: Status and Developments , 1997 .

[2]  Thomas A. Henzinger,et al.  HYTECH: The Cornell HYbrid TECHnology Tool , 1994, Hybrid Systems.

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

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

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

[6]  Tomas Rokicki.  Representing and modeling digital circuits , 1994 .

[7]  Guoliang Zheng,et al.  Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently , 2003, FORMATS.

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

[9]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.