Efficient verification of timed automata with BDD-like data structures

We investigate the effect on efficiency of various design issues for BDD-like data structures of TA state space representation and manipulation. We find that the efficiency is highly sensitive to decision atom design and canonical form definition. We explore the two issues in detail and propose to use CRD (Clock-Restriction Diagram) for TA state space representation and present algorithms for manipulating CRD in the verification of TAs. We compare three canonical forms for zones, develop a procedure for quick zone-containment detection, and present algorithms for verification with backward reachability analysis. Three possible evaluation orderings are also considered and discussed. We implement our idea in our tool Red 4.2 and carry out experiments to compare with other tools and various strategies of Red in both forward and backward analysis. Finally, we discuss the possibility of future improvement.

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

[2]  Farn Wang,et al.  Numerical Coverage Estimation for the Symbolic Simulation of Real-Time Systems , 2003, FORTE.

[3]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[4]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[5]  Wang Yi,et al.  Efficient Timed Reachability Analysis using Clock Difference Diagrams , 1998 .

[6]  Farn Wang,et al.  Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems , 2000, TACAS.

[7]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[8]  Wang Yi,et al.  Efficient verification of real-time systems: compact data structure and state-space reduction , 1997, Proceedings Real-Time Systems Symposium.

[9]  Henrik Reif Andersen,et al.  Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams , 2001, SMC@FLoC.

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

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

[12]  Farn Wang,et al.  Region Encoding Diagram for fully symbolic verification of real-time systems , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.

[13]  Farn Wang,et al.  Symbolic Model Checking for Distributed Real-Time Systems , 1993, FME.

[14]  Henrik Reif Andersen,et al.  Difference Decision Diagrams , 1999, CSL.

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

[16]  Farn Wang.  Symbolic Parametric Analysis of Embedded Systems with BDD-like Data-Structures , 2003, ArXiv.

[17]  Felice Balarin,et al.  Approximate reachability analysis of timed automata , 1996, 17th IEEE Real-Time Systems Symposium.

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

[19]  Farn Wang,et al.  TCTL Inevitability Analysis of Dense-Time Systems , 2003, CIAA.

[20]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[21]  Pao-Ann Hsiung,et al.  Efficient and User-Friendly Verification , 2002, IEEE Trans. Computers.

[22]  Farn Wang,et al.  Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram , 2001, FORTE.