Initialized hybrid automata with linear differential inclusions and rectangular constraints are hybrid automata where the invariants, guards, resets, and initial values are given by rectangular constraints, the flows are described by linear differential inclusions of the form $ax + b \lhd_1\dot{x} \lhd_2 cx+d$ (with $\lhd_1,\lhd_2 \in \{<,\leq\}$), and a variable $x$ is reset on mode change whenever the differential inclusion describing the dynamics for $x$ changes. Such automata strictly subsume initialized rectangular automata. Our main result is that while the control state reachability problem for such automata is undecidable, the time-bounded reachability problem is decidable.published or submitted for publicationis peer reviewe
Independent Dynamics Hybrid Automata (IDA) describe a new class of hybrid automata that extends deci...
We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata...
A new approach is presented for computing approximations of the reached sets of linear hybrid automa...
This paper investigates the time-bounded version of the reachability problem for hybrid automata. Th...
AbstractHybrid automata model systems with both digital and analog components, such as embedded cont...
Abstract. Within hybrid systems theory, o-minimal automata are often considered on the border betwee...
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid au...
Abstract. We study the time-bounded reachability problem for monotonic hy-brid automata (MHA), i.e.,...
Hybrid systems combine differential equations with discrete event systems. We consider the reachabil...
We illuminate the boundary between decidability and undecidability for hybrid systems. Adding any ...
Disributed control systems often exhibit aperiodic sampling behavior due to varying communication de...
Hybrid systems are dynamical systems with the ability to describe mixed discrete- continuous evoluti...
AbstractHybrid systems are dynamical systems with the ability to describe mixed discrete-continuous ...
Independent Dynamics Hybrid Automata (IDA) describe a new class of hybrid automata that extends deci...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
Independent Dynamics Hybrid Automata (IDA) describe a new class of hybrid automata that extends deci...
We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata...
A new approach is presented for computing approximations of the reached sets of linear hybrid automa...
This paper investigates the time-bounded version of the reachability problem for hybrid automata. Th...
AbstractHybrid automata model systems with both digital and analog components, such as embedded cont...
Abstract. Within hybrid systems theory, o-minimal automata are often considered on the border betwee...
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid au...
Abstract. We study the time-bounded reachability problem for monotonic hy-brid automata (MHA), i.e.,...
Hybrid systems combine differential equations with discrete event systems. We consider the reachabil...
We illuminate the boundary between decidability and undecidability for hybrid systems. Adding any ...
Disributed control systems often exhibit aperiodic sampling behavior due to varying communication de...
Hybrid systems are dynamical systems with the ability to describe mixed discrete- continuous evoluti...
AbstractHybrid systems are dynamical systems with the ability to describe mixed discrete-continuous ...
Independent Dynamics Hybrid Automata (IDA) describe a new class of hybrid automata that extends deci...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
Independent Dynamics Hybrid Automata (IDA) describe a new class of hybrid automata that extends deci...
We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata...
A new approach is presented for computing approximations of the reached sets of linear hybrid automa...