Add to ORKGThe paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows in all states is monotonic along some direction in the plane, and in which the continuous variables are not reset on a discrete transition. We also prove the undecidability for the same class of automata in 4-dimensions
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
We present a general framework for the formal specification and algorithmic analysis of hybrid sys...
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid au...
AbstractHybrid automata model systems with both digital and analog components, such as embedded cont...
. One of the most important analysis problems of hybrid systems is the reachability problem. State o...
The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This n...
We illuminate the boundary between decidability and undecidability for hybrid systems. Adding any ...
AbstractEven though many attempts have been made to define the boundary between decidable and undeci...
Initialized hybrid automata with linear differential inclusions and rectangular constraints are hybr...
Hybrid systems are systems that exhibit both discrete and continuous behavior. Reachability, the que...
© 2019 Springer-Verlag. This is a post-peer-review, pre-copyedit version of a paper published in Rea...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...
This paper presents a decision algorithm for the analysis of the stability of a class of planar swit...
Abstract. We study the time-bounded reachability problem for monotonic hy-brid automata (MHA), i.e.,...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
We present a general framework for the formal specification and algorithmic analysis of hybrid sys...
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid au...
AbstractHybrid automata model systems with both digital and analog components, such as embedded cont...
. One of the most important analysis problems of hybrid systems is the reachability problem. State o...
The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This n...
We illuminate the boundary between decidability and undecidability for hybrid systems. Adding any ...
AbstractEven though many attempts have been made to define the boundary between decidable and undeci...
Initialized hybrid automata with linear differential inclusions and rectangular constraints are hybr...
Hybrid systems are systems that exhibit both discrete and continuous behavior. Reachability, the que...
© 2019 Springer-Verlag. This is a post-peer-review, pre-copyedit version of a paper published in Rea...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...
This paper presents a decision algorithm for the analysis of the stability of a class of planar swit...
Abstract. We study the time-bounded reachability problem for monotonic hy-brid automata (MHA), i.e.,...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
We present a general framework for the formal specification and algorithmic analysis of hybrid sys...