A New Approach of Partial Order Reduction Technique for Parallel Timed Automata Model Checking

A new partial order reduction method for timed automaton model checking is presented in this paper. This method avoids exhaustive state-space exploration by enumerating only part of enabled transitions at some symbolic states. This paper gives some sufficient conditions on which partial enumeration does not change the reach ability analysis result. Efficient algorithms are presented to check these conditions. The optimized reach ability analysis algorithm only computes successors w.r.t. part of enabled transitions when it visits a symbolic state the first time. Later, the algorithm revisits generated states to check whether it is necessary to enumerate all transitions. Some experiments shows that the method significantly reduce the number of symbolic states generated during state space exploration.

[1]  Guoliang Zheng,et al.  Partial Order Path Technique for Checking Parallel Timed Automata , 2002, FTRTFT.

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

[3]  Patrice Godefroid,et al.  Dynamic partial-order reduction for model checking software , 2005, POPL '05.

[4]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1994, TOPL.

[5]  Hongyang Qu,et al.  Adding Invariants to Event Zone Automata , 2006, FORMATS.

[6]  Denis Lugiez,et al.  A partial order semantics approach to the clock explosion problem of timed automata , 2005, Theor. Comput. Sci..

[7]  Ruurd Kuiper,et al.  Partial-order Reduction Techniques for Real-time Model Checking , 1998, Formal Aspects of Computing.

[8]  Wang Yi,et al.  UPPAAL - present and future , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[9]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

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

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