On the complexity of bounded time and precision reachability for piecewise affine systems

DOI10.1016/j.tcs.2016.09.021zbMath1393.68066arXiv1601.05353OpenAlexW2529633050MaRDI QIDQ2636516

Hugo Bazille, Walid Gomaa, Amaury Pouly, Olivier Bournez

Publication date: 5 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.05353

zbMATH Keywords

complexityreachabilitypiecewise affine systems

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 (2)

Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• 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)
• On The Complexity of Bounded Time Reachability for Piecewise Affine Systems
• 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

This page was built for publication: On the complexity of bounded time and precision reachability for piecewise affine systems