Digital Object Identifier: 10.1109/CDC.2006.377733In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton to a timed automaton that preserves the stability and reachability properties of the former. The abstraction procedure discards the continuous dynamics of each mode in the hybrid automaton completely, keeping only the information about the maximum time in which the continuous state makes a discrete jump. This information is used to construct a timed automaton, based on the original hybrid automaton, and to prove that the stability and reachability properties of the original system are retained in the abstract timed automaton. In the process of abstracting a hybrid to a timed automaton we introd...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, ra...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...
In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton t...
Abstract. Within hybrid systems theory, o-minimal automata are often considered on the border betwee...
International audienceThis paper deals with formal controller synthesis for discrete-time dynamical ...
Discrete Abstractions of Hybrid Systems A hybrid system is a dynamical system with both discrete and...
Notations like hybrid automata are highly useful in the development process of hybrid systems to do...
Many natural systems exhibit a hybrid behavior characterized by a set of continuous laws which are s...
. Hybrid automata that can exhibit infinitely many discrete transitions in finite time are studied. ...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
ISBN : 978-0-521-76505-3Hybrid automata is a modeling formalism for hybrid systems that results from...
Hybrid systems combine differential equations with discrete event systems. We consider the reachabil...
The distinguishing characteristic of hybrid systems is the interaction between a continuous-time and...
Most of the observable natural phenomena exhibit a mixed discrete-continuous behavior characterized ...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, ra...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...
In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton t...
Abstract. Within hybrid systems theory, o-minimal automata are often considered on the border betwee...
International audienceThis paper deals with formal controller synthesis for discrete-time dynamical ...
Discrete Abstractions of Hybrid Systems A hybrid system is a dynamical system with both discrete and...
Notations like hybrid automata are highly useful in the development process of hybrid systems to do...
Many natural systems exhibit a hybrid behavior characterized by a set of continuous laws which are s...
. Hybrid automata that can exhibit infinitely many discrete transitions in finite time are studied. ...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
ISBN : 978-0-521-76505-3Hybrid automata is a modeling formalism for hybrid systems that results from...
Hybrid systems combine differential equations with discrete event systems. We consider the reachabil...
The distinguishing characteristic of hybrid systems is the interaction between a continuous-time and...
Most of the observable natural phenomena exhibit a mixed discrete-continuous behavior characterized ...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, ra...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...