Results 1 
5 of
5
Abstraction and CounterexampleGuided Refinement in Model Checking of Hybrid Systems
, 2003
"... 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 finitestate abstraction. Model checking can be inconclusive, however, in which case t ..."
Abstract

Cited by 55 (7 self)
 Add to MetaCart
(Show Context)
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 finitestate 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 finitestate 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.
M.: Verification of hybrid systems based on counterexampleguided abstraction refinement. In: Technical Report. (2002) Downloadable from http://www.cs.cmu.edu
 In: HSCC. LNCS 1569
, 1999
"... Abstract. 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 finitestate abstraction. Model checking can be inconclusive, however, in which ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
(Show Context)
Abstract. 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 finitestate 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 infinitestate systems, in particular of hybrid systems. Following an approach originally developed for finitestate 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. A detailed example illustrates our counterexampleguided refinement procedure. Experimental results for a prototype implementation of the procedure indicate its advantages over existing methods. 1
Verification of hybrid systems: Formalization and proof rules in PVS
 in PVS. In: ICECCS, IEEE Computer Society
, 2001
"... Combining discrete statemachines with continuous behavior, hybrid systems are a wellestablished mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of r ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Combining discrete statemachines with continuous behavior, hybrid systems are a wellestablished mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of research concentrates on model checking of finite abstractions of restricted subclasses of the general model. In our work, we use deductive methods, falling back upon the generalpurpose theorem prover PVS. To do so we extend the classical approach for the verification of statebased programs by developing an inductive proof method to deal with the parallel composition of hybrid systems. It covers shared variable communication, labelsynchronization, and especially the common continuous activities in the parallel composition of hybrid automata. Besides hybrid systems and their parallel composition, we formalized their operational step semantics and a number of proofrules within PVS, for one of which we give also a rigorous completeness proof. Moreover, the theory is applied to the verification of a number of examples.
Advances in CounterexampleGuided Abstraction/Refinement
, 2003
"... The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. ..."
Abstract
 Add to MetaCart
(Show Context)
The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law.
International Journal of Foundations of Computer Science c World Scientific Publishing Company ABSTRACTION AND COUNTEREXAMPLEGUIDED REFINEMENT IN MODEL CHECKING OF HYBRID SYSTEMS
"... 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 finitestate abstraction. Model checking can be inconclusi ..."
Abstract
 Add to MetaCart
(Show Context)
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 finitestate 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 finitestate 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 counterexampleguided refinement procedure. Experimental results for a prototype implementation indicate significant advantages over existing methods.