Deciding stability and mortality of piecewise affine dynamical systems
From MaRDI portal
Publication:5941097
DOI10.1016/S0304-3975(00)00399-6zbMath0973.68067OpenAlexW2113592921WikidataQ127203135 ScholiaQ127203135MaRDI QIDQ5941097
Pascal Koiran, Blondel, Vincent D., John N. Tsitsiklis, Olivier Bournez, Christos H. Papadimitriou
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00399-6
stabilityhybrid systemsdecidabilitydiscrete dynamical systemsmortalitypiecewise affine systemspiecewise linear systems
Related Items
On the Termination of Integer Loops ⋮ Reachability Problems for One-Dimensional Piecewise Affine Maps ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Recent advances in program verification through computer algebra ⋮ Termination of linear programs with nonlinear constraints ⋮ Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ ⋮ STORMED Hybrid Systems ⋮ Deciding the point-to-fixed-point problem for skew tent maps on an interval ⋮ REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS ⋮ About the Domino Problem for Subshifts on Groups ⋮ Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs ⋮ A survey of computational complexity results in systems and control ⋮ A dynamical system which must be stable whose stability cannot be proved ⋮ On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases ⋮ The stability of saturated linear dynamical systems is undecidable ⋮ On deciding stability of multiclass queueing networks under buffer priority scheduling policies ⋮ On the Undecidability of the Tiling Problem ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond ⋮ Topological formulation of termination properties of iterates of functions ⋮ The stability of the deterministic Skorokhod problem is undecidable ⋮ On the presence of periodic configurations in Turing machines and in counter machines.
Cites Work
- The algorithmic analysis of hybrid systems
- Complexity of stability and controllability of elementary hybrid systems
- Computability with low-dimensional dynamical systems
- On the computational power of dynamical systems and hybrid systems
- A family of universal recurrent networks
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- On the computational power of neural nets
- Unpredictability and undecidability in dynamical systems
- The undecidability of the Turing machine immortality problem
- A survey of computational complexity results in systems and control
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
