The Image Computation Problem in Hybrid Systems Model Checking

In this paper, we analyze limits of approximation techniques for (non-linear) continuous image computation in model checking hybrid systems. In particular, we show that even a single step of continuous image computation is not semidecidable numerically even for a very restricted class of functions. Moreover, we show that symbolic insight about derivative bounds provides sufficient additional information for approximation refinement model checking. Finally, we prove that purely numerical algorithms can perform continuous image computation with arbitrarily high probability. Using these results, we analyze the prerequisites for a safe operation of the roundabout maneuver in air traffic collision avoidance.

[1]  Mieke Massink,et al.  Modelling free flight with collision avoidance , 2001, Proceedings Seventh IEEE International Conference on Engineering of Complex Computer Systems.

[2]  A. Bejancu.  The Uniform Convergence of Multivariate Natural Splines , 1997 .

[3]  S. Shankar Sastry,et al.  Conflict resolution for air traffic management: a study in multiagent hybrid systems , 1998, IEEE Trans. Autom. Control..

[4]  J. Stoer,et al.  Introduction to Numerical Analysis , 2002 .

[5]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[6]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[7]  Bruce H. Krogh,et al.  Formal verification of hybrid systems using CheckMate: a case study , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[8]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[9]  Arjan van der Schaft,et al.  Analysis of hybrid systems , 2000 .

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

[11]  Ren-hong Wang.  Multivariate Spline Functions and Their Applications , 2001 .

[12]  B. I. Silva,et al.  Modeling and Verifying Hybrid Dynamic Systems Using CheckMate , 2001 .

[13]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[14]  Carla Piazza,et al.  Algorithmic Algebraic Model Checking I: Challenges from Systems Biology , 2005, CAV.

[15]  Gerardo Lafferriere,et al.  A New Class of Decidable Hybrid Systems , 1999, HSCC.

[16]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[17]  M. Stone.  The Generalized Weierstrass Approximation Theorem , 1948 .

[18]  Stephan Merz,et al.  Model Checking , 2000 .

[19]  Antoine Girard,et al.  Reachability Analysis of Nonlinear Systems Using Conservative Approximation , 2003, HSCC.

[20]  Goran Frehse,et al.  PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.

[21]  Mieke Massink,et al.  Modelling Free Flight with Collision Avoidance. : 270-280 , 2001 .

[22]  Hirokazu Anai,et al.  Reach Set Computations Using Real Quantifier Elimination , 2001, HSCC.

[23]  Simone Tini,et al.  Taylor approximation for hybrid systems , 2005, Inf. Comput..

[24]  Stefan Ratschan,et al.  Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems , 2005, ATVA.

[25]  W. T. Tutte,et al.  Encyclopedia of Mathematics and its Applications , 2001 .

[26]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.

[27]  Pravin Varaiya,et al.  Modeling and verification of hybrid systems , 1995, Proceedings of 1995 American Control Conference - ACC'95.