Date of Original Version
Electronic version of an article published as International Journal of Foundations of Computer Science 14(4), 2003, pp. 583-604 . http://dx.doi.org/10.1142/S012905410300190X © [copyright World Scientific Publishing Company] [http://www.worldscinet.com/ijfcs/14/1404/S012905410300190X.html]
Abstract or Description
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 [1, 2], 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 and experimental results for a prototype implementation of the procedure indicate significant advantages over existing methods.
International Journal of Foundations of Computer Science, 14, 4, 583-604.