Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures

We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs), for the representation and manipulation of linear hybrid automata (LHA) state-spaces, and present algorithms for weakest precondition calculations. This permits us to reason about the valuations of parameters that make safety properties satisfied. Advantages of our approach include the ability to represent discrete state information and concave polyhedra in a unified scheme as well as to save both memory consumptions and manipulation times, when processing the same substructures in state-space representations. Our experimental results document its efficiency in practice.

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

[2]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[3]  Thomas A. Henzinger,et al.  HYTECH: the next generation , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

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

[5]  Ahmed Bouajjani,et al.  Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems , 2000, CAV.

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

[7]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

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

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

[10]  Farn Wang,et al.  Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions , 2004, AMAST.

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

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

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

[14]  Thomas A. Henzinger,et al.  Parametric real-time reasoning , 1993, STOC.

[15]  Howard Wong-Toi,et al.  Symbolic approximations for verifying real-time systems , 1995 .

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

[17]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[18]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

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

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

[21]  Farn Wang,et al.  Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.