Refining Abstractions of Hybrid Systems Using Counterexample Fragments

Ansgar Fehnker, Edmund M. Clarke, Sumit Kumar Jha, Bruce H. Krogh

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

28 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationHybrid Systems: Computation and Control
Subtitle of host publication8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005. Proceedings
EditorsManfred Morari, Lothar Thiele
Number of pages16
ISBN (Electronic)978-3-540-31954-2
ISBN (Print)978-3-540-25108-8
Publication statusPublished - 2005
Externally publishedYes
Event8th International Workshop on Hybrid Systems: Computation and Control 2005 - ETH, Zurich, Switzerland
Duration: 9 Mar 200511 Mar 2005
Conference number: 8

Publication series

NameLecture Notes in Computer Science


Conference8th International Workshop on Hybrid Systems: Computation and Control 2005
Abbreviated titleHSCC 2005


Dive into the research topics of 'Refining Abstractions of Hybrid Systems Using Counterexample Fragments'. Together they form a unique fingerprint.

Cite this