Widening the Boundary Between Decidable and Undecidable Hybrid Systems
Eugène Asarin, Gerardo Schneider
Abstract
Eugène Asarin, Gerardo Schneider
Abstract
Abstract. We revisited decidability of the reachability problem for low dimensional hybridsystems. Eventhoughmanyattemptshavebeendone todraw theboundarybetween decidable and undecidable hybridsystems there are still many open problems in between. In this paper we show that the reachability question for some two dimensional hybrid systems are undecidable and that for other 2-dim systems this question remains unanswered, showing that it is as hard as the reachability problem for Piecewise Affine Maps, that is a well known open problem. 1
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract. We revisited decidability of the reachability problem for low dimensional hybridsystems. Eventhoughmanyattemptshavebeendone todraw theboundarybetween decidable and undecidable hybridsystems there are still many open problems in between. In this paper we show that the reachability question for some two dimensional hybrid systems are undecidable and that for other 2-dim systems this question remains unanswered, showing that it is as hard as the reachability problem for Piecewise Affine Maps, that is a well known open problem. 1
Key concepts: Undecidable problem, Decidability, Reachability, Reachability problem, Computer science, Boundary (topology), Hybrid automaton, Discrete mathematics