Pre-orders on systems are the basis for abstraction based verification of systems. In this paper, we investigate pre-orders for reasoning about stability with respect to inputs of hybrid systems. First, we present a superposition type theorem which gives a characterization of the classical incremental input-to-state stability of continuous systems in terms of the traditional ε-δ definition of stability. We use this as the basis for defining a notion of incremental input-to-state stability of hybrid systems. Next, we present a pre-order on hybrid systems which preserves incremental input-to-state stability, by extending the classical definitions of bisimulation relations on systems with input, with uniform continuity constraints. We show tha...
We propose a methodology for the speci cation, veri cation, and design of hybrid systems. The method...
Abstract: In this paper we introduce two improvements to the method of verification of hybrid system...
We develop a general framework for obtaining upper bounds on the “practical ” computational complexi...
Pre-orders on systems are the basis for abstraction based verification of systems. In this paper, we...
Simulation and bisimulation relations define pre-orders on processes which serve as the basis for ap...
Pre-orders between processes, like simulation, have played a central role in the verification and an...
Pre-orders between processes, like simulation, have played a central role in the verification and a...
Abstract—The paper presents a counterexample-guided abstraction refinement procedure for verifying s...
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid sy...
We call a hybrid system {\em stable} if every trajectory inevitably ends up in a given region. Our n...
We present results for the analysis of input/output properties of a general class of hybrid systems ...
The analysis of incremental stability properties typically involves measuring the distance between a...
We propose a methodology for the specification, verification, and design of hybrid systems. The meth...
International audienceThe use of bisimilar finite abstractions of continuous and hybrid systems, gre...
Communicated by Editor’s name Hybrid dynamic systems include both continuous and discrete state vari...
We propose a methodology for the speci cation, veri cation, and design of hybrid systems. The method...
Abstract: In this paper we introduce two improvements to the method of verification of hybrid system...
We develop a general framework for obtaining upper bounds on the “practical ” computational complexi...
Pre-orders on systems are the basis for abstraction based verification of systems. In this paper, we...
Simulation and bisimulation relations define pre-orders on processes which serve as the basis for ap...
Pre-orders between processes, like simulation, have played a central role in the verification and an...
Pre-orders between processes, like simulation, have played a central role in the verification and a...
Abstract—The paper presents a counterexample-guided abstraction refinement procedure for verifying s...
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid sy...
We call a hybrid system {\em stable} if every trajectory inevitably ends up in a given region. Our n...
We present results for the analysis of input/output properties of a general class of hybrid systems ...
The analysis of incremental stability properties typically involves measuring the distance between a...
We propose a methodology for the specification, verification, and design of hybrid systems. The meth...
International audienceThe use of bisimilar finite abstractions of continuous and hybrid systems, gre...
Communicated by Editor’s name Hybrid dynamic systems include both continuous and discrete state vari...
We propose a methodology for the speci cation, veri cation, and design of hybrid systems. The method...
Abstract: In this paper we introduce two improvements to the method of verification of hybrid system...
We develop a general framework for obtaining upper bounds on the “practical ” computational complexi...