REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS

DOI10.1142/S0129054108006054MaRDI QIDQ3526544zbMATH OpenFDO

Authors O. Kurganskyy, Igor Potapov, Fernando Sancho Caparrini

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

Recommendations

• Computation in One-Dimensional Piecewise Maps
• On reachability problem in 1-dimensional 2-interval piecewise-affine mappings
• Reachability problems for one-dimensional piecewise affine maps
• Universality of one-dimensional piecewise elementary maps
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers

Cites work

• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A survey of computational complexity results in systems and control
• Computability with low-dimensional dynamical systems
• Deciding stability and mortality of piecewise affine dynamical systems
• Periodicity and chaos from switched flow systems: contrasting examples of discretely controlled continuous systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• The entropy of 'strange' billiards inside n-simplexes

Cited in

(14)

• Universality of one-dimensional piecewise elementary maps
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers
• On Affine Reachability Problems
• scientific article; zbMATH DE number 5519537 (Why is no real title available?)
• On the decidability and complexity of problems for restricted hierarchical hybrid systems
• Reachability problems for PAMs
• The invariance problem for matrix semigroups
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• Reachability problems for one-dimensional piecewise affine maps
• On the decidability of reachability in continuous time linear time-invariant systems
• Computation in One-Dimensional Piecewise Maps
• Unconventional Computation
• On reachability problem in 1-dimensional 2-interval piecewise-affine mappings
• Mortality and Edge-to-Edge Reachability are Decidable on Surfaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526544)