On The Complexity of Bounded Time Reachability for Piecewise Affine Systems

DOI10.1007/978-3-319-11439-2_2zbMath1393.68065OpenAlexW2226804515MaRDI QIDQ3447692

Hugo Bazille, Walid Gomaa, Amaury Pouly, Olivier Bournez

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11439-2_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Reachability Problems for One-Dimensional Piecewise Affine Maps, On the complexity of bounded time and precision reachability for piecewise affine systems, Mortality and Edge-to-Edge Reachability are Decidable on Surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• What's decidable about hybrid automata?
• Computability with low-dimensional dynamical systems
• Computing over the reals with addition and order
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• On the computational power of neural nets
• Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
• Reachability Problems for Hierarchical Piecewise Constant Derivative Systems
• Generalized shifts: unpredictability and undecidability in dynamical systems
• The stability of saturated linear dynamical systems is undecidable