Deciding stability and mortality of piecewise affine dynamical systems
- 28 March 2001
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 255 (1-2) , 687-696
- https://doi.org/10.1016/s0304-3975(00)00399-6
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Stability of Saturated Linear Dynamical Systems Is UndecidablePublished by Springer Nature ,2000
- Complexity of stability and controllability of elementary hybrid systemsAutomatica, 1999
- On unsolvability of nonlinear system stabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- On the computational power of dynamical systems and hybrid systemsTheoretical Computer Science, 1996
- A family of universal recurrent networksTheoretical Computer Science, 1996
- Reachability analysis of dynamical systems having piecewise-constant derivativesTheoretical Computer Science, 1995
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- What's decidable about hybrid automata?Published by Association for Computing Machinery (ACM) ,1995
- Computability with low-dimensional dynamical systemsTheoretical Computer Science, 1994
- The undecidability of the Turing machine immortality problemThe Journal of Symbolic Logic, 1966