Communicated by Editor’s name Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement operation for abstractions of hybrid systems. Following an approach originally developed for finite-state systems [11, 25], the refinement procedure constructs a new abstraction that eliminates a counterexample generated by the model checker. For hybrid systems, analysis of the counterexample requires the computation of sets of reachable states in the continuous state space. We show how such reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently. Examples illustrate our counterexample-guided refinement procedure. Experimental results for a prototype implementation indicate significant advantages over existing methods.
|
568
|
Design and synthesis of synchronization skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
353
|
Computer-Aided Verification of Coordinating Processes
– Kurshan
- 1994
|
|
277
|
Counterexample-guided abstraction refinement
– Clarke, Grumberg, et al.
|
|
269
|
HYTECH: A model checker for hybrid systems
– Henzinger, Ho, et al.
- 1997
|
|
265
|
The theory of hybrid automata
– Henzinger
- 1996
|
|
238
|
Lazy Abstraction
– Henzinger, Jhala, et al.
- 2002
|
|
228
|
Automatic predicate abstraction of C programs
– Ball, Majumdar, et al.
- 2001
|
|
211
|
What’s decidable about hybrid automata
– Henzinger, Kopke, et al.
- 1998
|
|
101
|
Discrete abstractions of hybrid systems
– Alur, Henzinger, et al.
- 2000
|
|
81
|
Algorithmic analysis of nonlinear hybrid systems
– Henzinger, Ho
- 1995
|
|
73
|
Ellipsoidal Techniques for Reachability Analysis
– Kurzhanski, Varaiya
|
|
67
|
Approximate reachability analysis of piecewise-linear dynamical systems
– Asarin, Bournez, et al.
- 2000
|
|
66
|
Yovine S., A New Class of Decidable Hybrid Systems
– Lafferriere, Pappas
|
|
63
|
Variable Structure systems with sliding modes
– Utkin
- 1977
|
|
58
|
Reachability analysis via face-lifting
– Dang, Maler
- 1998
|
|
44
|
Series of abstractions for hybrid automata
– Tiwari, Khanna
|
|
39
|
Bach: an Eternal Golden Braid. Basic Books
– Hofstadter, Escher
- 1979
|
|
37
|
Formal Methods and their Role in the Certification of Critical Systems
– Rushby
- 1995
|
|
35
|
SAT based abstraction-refinement using ILP and machine learning techniques
– Clarke, Gupta, et al.
- 2002
|
|
31
|
Reachability analysis of hybrid systems via predicate abstraction
– Alur, Dang, et al.
- 2002
|
|
30
|
Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations
– Chutinam, Krogh
- 1999
|
|
30
|
PHAVer: Algorithmic verification of hybrid systems past HyTech
– Frehse
- 2005
|
|
26
|
Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations
– Chutinan, Krogh
- 1999
|
|
24
|
Reachability analysis using polygonal projections
– Greensreet, Mitchell
- 1999
|
|
19
|
An assessment of the current status of algorithmic approaches to the verification of hybrid systems
– Silva, Stursberg, et al.
- 2001
|
|
18
|
Counter-example guided predicate abstraction of hybrid systems
– Alur, Dang, et al.
- 2003
|
|
17
|
Hybrid I/O automata revisited
– Lynch, Segala, et al.
- 2001
|
|
15
|
Dynamic partitioning in analyses of numerical properties
– Jeannet, Halbwachs, et al.
- 1999
|
|
14
|
Verification of infinite-state dynamic systems using approximate quotient transition systems
– Chutinan, Krogh
|
|
14
|
Assume-guarantee reasoning for hierarchical hybrid systems
– Henzinger, Minea, et al.
- 2001
|
|
13
|
Sistla: Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications: a practical approach
– Clarke, Emerson, et al.
- 1983
|
|
12
|
Verification of hybrid systems based on counterexample-guided abstraction refinement
– Clarke, Fehnker, et al.
- 2003
|
|
12
|
Some lessons from the HyTech experience
– Henzinger, Preussig, et al.
- 2001
|
|
8
|
A Control Architecture for Integrated Cooperative Cruise Control with Collision Warning Systems
– Girard, Sousa, et al.
- 2001
|
|
8
|
On efficient representation and computation of reachable sets for hybrid systems
– Strusberg, Krogh
- 2003
|
|
7
|
Semantic translation of Simulink/Stateflow models to hybrid automata using graph transformations
– Agrawal, Simon, et al.
- 2004
|
|
6
|
Vérification et synthèse des systémes hybrides
– Dang
- 2000
|
|
4
|
B.: Modular analysis of discrete controllers for distributed hybrid systems
– Frehse, Stursberg, et al.
- 2002
|
|
4
|
Embedded software control design for an electronic throttle body
– Griffiths
- 2002
|
|
4
|
Modeling and verification of hybrid system with clocked and unclocked events
– Silva, Krogh
- 2001
|
|
3
|
Using reduced-order models in reachability analysis of hybrid systems
– Han, Krogh
- 2004
|
|
2
|
A new tool for verifying computer controlled systems
– Kapinski, Krogh
- 2002
|
|
2
|
Verifying asymptotic bounds for discrete-time sliding mode systems with disturbance inputs
– Kapinski, Krogh
- 2004
|
|
1
|
Hybrid system verification is not a sinecure: The electronic throttle control case study
– Fehnker, Krogh
- 2004
|
|
1
|
Compositional verification of continuous-discrete systems
– Huuck, Lukoschus, et al.
- 2002
|
