Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
Computability with low-dimensional dynamical systems
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
Universal computation and other capabilities of hybrid and continuous dynamical systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Deciding reachability for planar multi-polynomial systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
Expressiveness of Updatable Timed Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On some Relations between Dynamical Systems and Transition Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Towards a Geometric Theory of Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
On the Decidability of the Reachability Problem for Planar Differential Inclusions
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Reachability Analysis of Planar Multi-limear Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Polyhedral Flows in Hybrid Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Complexity of stability and controllability of elementary hybrid systems
Automatica (Journal of IFAC)
Computing invariance kernels of polygonal hybrid systems
Nordic Journal of Computing
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Theoretical Computer Science
On undecidability bounds for matrix decision problems
Theoretical Computer Science
Reachability analysis of generalized polygonal hybrid systems
Proceedings of the 2008 ACM symposium on Applied computing
Reachability in Linear Dynamical Systems
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Relaxing Goodness Is Still Good
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Computing Omega-Limit Sets in Linear Dynamical Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Computation in one-dimensional piecewise maps
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
A compositional algorithm for parallel model checking of polygonal hybrid systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Low dimensional hybrid systems - decidable, undecidable, don't know
Information and Computation
Refining the undecidability frontier of hybrid automata
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Lowering undecidability bounds for decision questions in matrices
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We revisited decidability of the reachability problem for low dimensional hybrid systems. Even though many attempts have been done to draw the boundary between decidable and undecidable hybrid systems 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.