Accurate Widenings and Boundedness Properties of Timed Systems

We propose a symbolic model checking procedure for timed systems that is based on operations on constraints. To accelerate the termination of the model checking procedure, we define history-dependent widening operators, again in terms of constraint-based operations. We show that these widenings are accurate, i.e., they don't lose precision even with respect to the test of boundedness properties.

[1]  Richard Gerber,et al.  Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results , 1999, TOPL.

[2]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

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

[4]  Wang Yi,et al.  UPPAAL in 1995 , 1996, TACAS.

[5]  Laurent Fribourg,et al.  Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic , 1999, CONCUR.

[6]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

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

[8]  Nicolas Halbwachs,et al.  Verification of Real-Time Systems using Linear Relation Analysis , 1997, Formal Methods Syst. Des..

[9]  Rajeev Alur,et al.  Minimization of Timed Transition Systems , 1992, CONCUR.

[10]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[11]  Nicolas Halbwachs,et al.  Delay Analysis in Synchronous Programs , 1993, CAV.

[12]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[13]  Thomas A. Henzinger,et al.  From Pre-Historic to Post-Modern Symbolic Model Checking , 1998, Formal Methods Syst. Des..

[14]  Thomas A. Henzinger,et al.  HYTECH: A Model Checker for Hybrid Systems , 1997, CAV.

[15]  Wang Yi,et al.  Compositional and symbolic model-checking of real-time systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[16]  Howard Wong-Toi,et al.  Automated Analysis of an Audio Control Protocol , 1995, CAV.

[17]  Thomas A. Henzinger,et al.  From Pre-historic to Post-modern Symbolic Model Checking , 1998, CAV.

[18]  Thomas A. Henzinger,et al.  A Note on Abstract Interpretation Strategies for Hybrid Automata , 1994, Hybrid Systems.

[19]  Pierre Wolper,et al.  Symbolic Verification with Periodic Sets , 1994, CAV.

[20]  Richard Gerber,et al.  Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic , 1997, CAV.

[21]  Stavros Tripakis,et al.  Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.

[22]  Bernard Boigelot,et al.  An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract) , 1997, CAV.

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

[24]  Supratik Mukhopadhyay,et al.  Model Checking for Timed Logic Processes , 2000, Computational Logic.

[25]  Thomas A. Henzinger,et al.  From Quantity to Quality , 1997, HART.