Deciding stability and mortality of piecewise affine dynamical systems

[1]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[2]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[3]  John N. Tsitsiklis,et al.  The Stability of Saturated Linear Dynamical Systems Is Undecidable , 2000, J. Comput. Syst. Sci..

[4]  John N. Tsitsiklis,et al.  Complexity of stability and controllability of elementary hybrid systems , 1999, Autom..

[5]  J. Tsitsiklis,et al.  Overview of complexity and decidability results for three classes of elementary nonlinear systems , 1999 .

[6]  H. Hyötyniemi.  On unsolvability of nonlinear system stability , 1997 .

[7]  H. Hyotyniemi.  On unsolvability of nonlinear system stability , 1997, 1997 European Control Conference (ECC).

[8]  Pascal Koiran.  A Family of Universal Recurrent Networks , 1996, Theor. Comput. Sci..

[9]  Olivier Bournez,et al.  On the Computational Power of Dynamical Systems and Hybrid Systems , 1996, Theor. Comput. Sci..

[10]  Thomas A. Henzinger,et al.  Hybrid systems III : verification and control , 1996 .

[11]  Eduardo D. Sontag,et al.  Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time , 1996, Hybrid Systems.

[12]  Eduardo Sontag.  From linear to nonlinear: some complexity comparisons , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[13]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[14]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[15]  Amir Pnueli,et al.  Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..

[16]  Michel Cosnard,et al.  Computability with Low-Dimensional Dynamical Systems , 1994, Theor. Comput. Sci..

[17]  Michel Cosnard,et al.  Computability Properties of Low-dimensional Dynamical Systems , 1993, STACS.

[18]  Hava T. Siegelmann,et al.  On the computational power of neural nets , 1992, COLT '92.

[19]  Eduardo Sontag,et al.  Turing computability with neural nets , 1991 .

[20]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.

[21]  Eduardo D. Sontag,et al.  Mathematical Control Theory: Deterministic Finite Dimensional Systems , 1990 .

[22]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[23]  Philip K. Hooper.  The undecidability of the Turing machine immortality problem , 1966, Journal of Symbolic Logic.