REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS

DOI10.1142/S0129054108006054zbMath1155.68025MaRDI QIDQ3526544

Fernando Sancho Caparrini, Oleksiy Kurganskyy, Igor Potapov

Publication date: 25 September 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

universalityiterative piecewise mapspseudo-billiard systems

Mathematics Subject Classification ID

Related Items (8)

Reachability Problems for One-Dimensional Piecewise Affine Maps ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ The Invariance Problem for Matrix Semigroups ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ On Affine Reachability Problems

Cites Work

• Unnamed Item
• Computability with low-dimensional dynamical systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• The entropy of 'strange' billiards inside n-simplexes
• Periodicity and chaos from switched flow systems: contrasting examples of discretely controlled continuous systems
• A survey of computational complexity results in systems and control
• Deciding stability and mortality of piecewise affine dynamical systems

This page was built for publication: REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS