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.
KeywordsHybrid System Abstract State Abstract Transition Concrete Syntax Pruning Algorithm
Unable to display preview. Download preview PDF.
- 8.Cousot, P., Cousot, R.: Automatic synthesis of optimal invariant assertions: Mathematical foundations. In: Proceedings of the 1977 Symposium on Artificial Intelligence and Programming Languages, pp. 1–12 (1977)Google Scholar
- 10.Dzetkulič, T., Ratschan, S.: How to capture hybrid systems evolution into slices of parallel hyperplanes. In: ADHS 2009: 3rd IFAC Conference on Analysis and Design of Hybrid Systems, pp. 274–279 (2009)Google Scholar
- 11.Frehse, G., Krogh, B.H., Rutenbar, R.A.: Verifying analog oscillator circuits using forward/backward abstraction refinement. In: DATE 2006: Design, Automation and Test in Europe (2006)Google Scholar
- 12.Henzinger, T.A., Ho, P.-H.: A note on abstract interpretation strategies for hybrid automata. LNCS, vol. 999, pp. 252–264 (1995)Google Scholar
- 16.Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation based abstraction refinement. ACM Transactions in Embedded Computing Systems 6(1) (2007)Google Scholar