Deciding stability and mortality of piecewise affine dynamical systems

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 687-696

  Blondel, Vincent D ^a   Bournez, Olivier ^b   Koiran, Pascal ^c   Papadimitriou, Christos H ^d   Tsitsiklis, John N ^e  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b LORIA   (France)

^c UNIVERSITÉ DE LYON   (France)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Decidability; Discrete dynamical systems; Hybrid systems; Mortality; Piecewise affine systems; Piecewise linear systems; Stability

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONVERGENCE OF NUMERICAL METHODS; THEOREM PROVING;

PIECEWISE AFFINE DYNAMICAL SYSTEMS;

PIECEWISE LINEAR TECHNIQUES;

EID: 0034915180     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00399-6     Document Type: Article

References (17)

1. The algorithmic analysis of hybrid systems
2. Reachability analysis of dynamical systems having piecewise constant derivatives
3. The stability of saturated linear dynamical systems is undecidable
4. Complexity of stability and controllability of elementary hybrid systems
5. A survey of computational complexity results in systems and control
6. On the computational power of dynamical systems and hybrid systems
7. What's decidable about hybrid automata
8. The undecidability of the Turing machine immortality problem
9. On unsolvability of nonlinear system stability
10. Computability properties of low-dimensional dynamical systems
11. A family of universal recurrent networks
12. Unpredictability and undecidability in dynamical systems
13. On the computational power of neural nets
14. From linear to nonlinear: Some complexity comparisons
15. Interconnected automata and linear systems: A theoretical framework in discrete time