Abstract
The method for verification of hybrid systems by constraint propagation based abstraction refinement that we introduced in an earlier paper is based on an over-approximation of continuous reachability information of ordinary differential equations using constraints that do not contain differentiation symbols. The method uses an interval constraint propagation based solver to solve these constraints. This has the advantage that—without complicated algorithmic changes—the method can be improved by just changing these constraints. In this paper, we discuss various possibilities of such changes, we prove some properties about the amount of over-approximations introduced by the new constraints, and provide some timings that document the resulting improvement.
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS). See www.avacs.org for more information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anai, H., Weispfenning, V.: Reach set computation using real quantifier elimination. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 63–76. Springer, Heidelberg (2001)
Belta, C., Schug, J., Dang, T., Kumar, V., Pappas, G., Rubin, H., Dunlap, P.: Stability and reachability analysis of a hybrid model of luminescence in the marine bacterium vibrio fisheri. In: CDC 2001 - Conference on Decision and Control, Florida, USA (2001)
Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming 32(1), 1–24 (1997)
Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM 50(5), 752–794 (2003)
Davis, E.: Constraint propagation with interval labels. Artif. Intell. 32(3), 281–331 (1987)
Frehse, G.: PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Morari, Thiele, [10]
Hickey, T., Wittenberg, D.: Rigorous modeling of hybrid systems using interval arithmetic constraints. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 402–416. Springer, Heidelberg (2004)
Hickey, T.J.: Analytic constraint solving and interval arithmetic. In: Proceedings of the 27th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 338–351. ACM Press, New York (2000)
Hickey, T.J.: Metalevel interval arithmetic and verifiable constraint solving. Journal of Functional and Logic Programming 2001(7) (October 2001)
Morari, M., Thiele, L. (eds.): HSCC 2005. LNCS, vol. 3414. Springer, Heidelberg (2005)
Puri, A., Varaiya, P.: Driving safely in smart cars. In: Proc. of the 1995 American Control Conference, pp. 3597–3599 (1995)
Ratschan, S.: RSolver. Software package (2004), http://rsolver.sourceforge.net
Ratschan, S.: Efficient solving of quantified inequality constraints over the real numbers. ACM Transactions on Computational Logic (to appear, 2005)
Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation based abstraction refinement. ACM Journal in Embedded Computing Systems (to appear)
Ratschan, S., She, Z.: HSolver. Software package (2004), http://hsolver.sourceforge.net
Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation based abstraction refinement. In: Morari, Thiele, [10]
Stursberg, O., Kowalewski, S., Engell, S.: On the generation of timed discrete approximations for continuous systems. Mathematical and Computer Models of Dynamical Systems 6, 51–70 (2000)
Stursberg, O., Kowalewski, S., Hoffmann, I., Preußig, J.: Comparing timed and hybrid automata as approximations of continuous systems. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1996. LNCS, vol. 1273, pp. 361–377. Springer, Heidelberg (1997)
Tiwari, A.: Approximate reachability for linear systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 514–525. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ratschan, S., She, Z. (2006). Constraints for Continuous Reachability in the Verification of Hybrid Systems. In: Calmet, J., Ida, T., Wang, D. (eds) Artificial Intelligence and Symbolic Computation. AISC 2006. Lecture Notes in Computer Science(), vol 4120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11856290_18
Download citation
DOI: https://doi.org/10.1007/11856290_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39728-1
Online ISBN: 978-3-540-39730-4
eBook Packages: Computer ScienceComputer Science (R0)