Incremental Computation of Succinct Abstractions for Hybrid Systems

In this paper, we introduce a new approach to computing abstractions for hybrid dynamical systems whose continuous behavior is governed by non-linear ordinary differential equations. The abstractions try to capture the reachability information relevant for a given safety property as succinctly as possible. This is achieved by an incremental refinement of the abstractions, simultaneously trying to avoid increases in their size as much as possible. The approach is independent of a concrete technique for computing reachability information, and can hence be combined with whatever technique suitable for the problem class at hand. We illustrate the usefulness of the technique with computational experiments.

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

[2]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[3]  Frédéric Benhamou,et al.  Continuous and Interval Constraints , 2006, Handbook of Constraint Programming.

[4]  Bernd Finkbeiner,et al.  Slicing abstractions , 2007, FSEN'07.

[5]  Stefan Ratschan,et al.  Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate , 2009, TAP@TOOLS.

[6]  Stefan Ratschan,et al.  Efficient solving of quantified inequality constraints over the real numbers , 2002, TOCL.

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

[8]  François Bourdoncle,et al.  Efficient chaotic iteration strategies with widenings , 1993, Formal Methods in Programming and Their Applications.

[9]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[10]  Frank Pfenning,et al.  Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings , 2007, CADE.

[11]  Sumit Gulwani,et al.  Logical Interpretation: Static Program Analysis Using Theorem Proving , 2007, CADE.

[12]  Rajeev Alur,et al.  Predicate abstraction for reachability analysis of hybrid systems , 2006, TECS.

[13]  Stefan Ratschan,et al.  Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement , 2005, HSCC.

[14]  Krzysztof R. Apt,et al.  The Essence of Constraint Propagation , 1998, Theor. Comput. Sci..

[15]  Joël Ouaknine,et al.  Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems , 2003, Int. J. Found. Comput. Sci..

[16]  Krzysztof R. Apt.  The role of commutativity in constraint propagation algorithms , 2000, TOPL.

[17]  Manfred Broy,et al.  Formal Methods in Programming and Their Applications , 1993, Lecture Notes in Computer Science.

[18]  Stefan Ratschan.  Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable , 2010, TAMC.

[19]  Patrick Cousot,et al.  Automatic synthesis of optimal invariant assertions: Mathematical foundations , 1977 .

[20]  Rob A. Rutenbar,et al.  Verifying analog oscillator circuits using forward/backward abstraction refinement , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[21]  Stefan Ratschan,et al.  How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes , 2009, ADHS.