Abstract
Counterexample guided abstraction refinement, a powerful technique for verifying properties of discrete-state systems, has been extended recently to hybrid systems verification. Unlike in discrete systems, however, establishing the successor relation for hybrid systems can be a fairly expensive step since it requires evaluation and over-approximation of the continuous dynamics. It has been observed that it is often sufficient to consider fragments of counterexamples rather than complete counterexamples. In this paper we further develop the idea of fragments. We extend the notion of cut sets in directed graphs to cutting sets of fragments in abstractions. Cutting sets of fragments are then used to guide the abstraction refinement in order to prove safety properties for hybrid systems.
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
Alur, R., Dang, T., Ivančić, F.: Counter-example guided predicate abstraction of hybrid system. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619. Springer, Heidelberg (2003)
Chutinan, A., Krogh, B.: Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 76–90. Springer, Heidelberg (1999)
Clarke, E., Fehnker, A., Han, Z., Krogh, B., Ouaknine, J., Stursberg, O., Theobald, M.: Abstraction and counterexample-guided refinement in model checking of hybrid systems. International Journal of Foundations of Computer Science 14, 583–604 (2003)
Tiwari, A., Khanna, G.: Series of abstractions for hybrid automata. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 465–478. Springer, Heidelberg (2002)
Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)
Kurshan, R.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)
Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? In: Proceedings of the 27th Annual Symposium on Theory of Computing, pp. 373–382. ACM Press, New York (1995)
Sheyner, O.: Scenario Graphs and Attack Graphs. PhD thesis, SCS, Carnegie Mellon University (2004)
Skiena, S.: The Algorithm Design Manual. Telos/Springer (1998)
Girard, A., Souza, J., Misener, J., Hedrick, J.: A control architecture for integrated cooperative cruise control and collision warning systems. In: Proc. 40th IEEE Conf. on Decision and Control (2001)
Stursberg, O., Fehnker, A., Han, Z., Krogh, B.: Specification-guided analysis of hybrid systems using a hierachy of validation methods. In: Proc. IFAC Conference ADHS. Elsevier, Amsterdam (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fehnker, A., Clarke, E., Jha, S.K., Krogh, B. (2005). Refining Abstractions of Hybrid Systems Using Counterexample Fragments. In: Morari, M., Thiele, L. (eds) Hybrid Systems: Computation and Control. HSCC 2005. Lecture Notes in Computer Science, vol 3414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31954-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-31954-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25108-8
Online ISBN: 978-3-540-31954-2
eBook Packages: Computer ScienceComputer Science (R0)