Verification of linear hybrid systems by means of convex approximations
N Halbwachs, YE Proy, P Raymond - International Static Analysis …, 1994 - Springer
We present a new application of the abstract interpretation by means of convex polyhedra, to
a class of hybrid systems, ie, systems involving both discrete and continuous variables. The …
a class of hybrid systems, ie, systems involving both discrete and continuous variables. The …
Using abstractions for the verification of linear hybrid systems
Hybrid systems are dynamical systems consisting of interacting discrete and continuous
components [NSY91, MMP91]. They are used to model the combined behavior of embedded …
components [NSY91, MMP91]. They are used to model the combined behavior of embedded …
Hybrid system verification using discrete model approximations
A Chutinan - 1999 - search.proquest.com
This dissertation presents a computational technique for verifying properties of hybrid
systems with continuous dynamics described by ordinary differential equations. The …
systems with continuous dynamics described by ordinary differential equations. The …
Reachability analysis of hybrid systems using support functions
C Le Guernic, A Girard - International Conference on Computer Aided …, 2009 - Springer
This paper deals with conservative reachability analysis of a class of hybrid systems with
continuous dynamics described by linear differential inclusions, convex invariants and …
continuous dynamics described by linear differential inclusions, convex invariants and …
Verification of hybrid systems with linear differential inclusions using ellipsoidal approximations
O Botchkarev, S Tripakis - … Workshop on Hybrid Systems: Computation and …, 2000 - Springer
A general verification algorithm is described. It is then shown how ellipsoidal methods
developed by AB Kurzhanski and P. Varaiya can be adapted to the algorithm. New …
developed by AB Kurzhanski and P. Varaiya can be adapted to the algorithm. New …
On the automatic verification of systems with continuous variables and unbounded discrete data structures
A Bouajjani, R Echahed, R Robbana - International Hybrid Systems …, 1994 - Springer
We address the verification problem of invariance properties for hybrid systems. We
consider as general models of hybrid systems finite automata, supplied with (unbounded) …
consider as general models of hybrid systems finite automata, supplied with (unbounded) …
Polyhedral analysis for synchronous languages
We define an operational semantics for the Signal language and design an analysis which
allows to verify properties pertaining to the relation between values of the numeric and …
allows to verify properties pertaining to the relation between values of the numeric and …
The algorithmic analysis of hybrid systems
We present a general framework for the formal specification and algorithmic analysis of
hybrid systems. A hybrid system consists of a discrete program with an analog environment …
hybrid systems. A hybrid system consists of a discrete program with an analog environment …
Verification of hybrid systems based on counterexample-guided abstraction refinement
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 …
hybrid systems, which have an infinite state space, can often be verified using ordinary …
Model checking of hybrid systems: From reachability towards stability
A Podelski, S Wagner - … Workshop on Hybrid Systems: Computation and …, 2006 - Springer
We call a hybrid system stable if every trajectory inevitably ends up in a given region. Our
notion of stability deviates from classical definitions in control theory. In this paper, we …
notion of stability deviates from classical definitions in control theory. In this paper, we …