Complexity of stability and controllability of elementary hybrid systems

Automatica

Volumn 35, Issue 3, 1999, Pages 479-489

  Blondel, Vincent D ^a   Tsitsiklis, John N ^b  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTROLLABILITY; LINEAR SYSTEMS; PROBLEM SOLVING; STATE SPACE METHODS; SYSTEM STABILITY;

COMPUTABILITY; HYBRID SYSTEMS;

NONLINEAR SYSTEMS;

EID: 0033100637     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(98)00175-7     Document Type: Article

References (25)

1. Asarin, A., Maler, O., & Pnueli, A. (1995). Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoret. Comput. Sci., 138, 35-66.
2. Blondel, V. D., Tsitsiklis, J. N. (1997). When is a pair of matrices mortal?. Inform. Process. Lett., 63, 283-286.
3. Blondel, V. D., & Tsitsiklis, J. N. (1999). A survey of computational complexity results in systems and control. Preprint. Submitted to Automatica.
4. Blondel, V. D., & Tsitsiklis, J. N. (1998). Overview of complexity and decidability results for three classes of elementary nonlinear systems. Lecture Notes in Control and Information Sciences. Berlin: Springer. In Learning, Control and Hybrid Systems, Y. Yamamoto and S. Haza (Eds), Springer, Heidelberg, pp. 46-58.
5. Bournez, O., & Cosnard, M. (1996). On the computational power of dynamical systems and hybrid systems. Theoret. Comput. Sci., 168, 417-459.
6. Branicky, M. S. (1995). Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoret. Comput. Sci., 138, 67-100.
7. Daubechies, I., & Lagarias, J. C. (1992). Sets of matrices all infinite products of which converge. Linear Algebra Appl., 162, 227-263.
8. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. New York: Freeman and Co.
9. Gurvits, L. (1995). Stability of discrete linear inclusions. Linear Algebra Appl., 231, 47-85.
10. Gurvits, L. (1997). Stability of Linear Inclusions - Part 2. unpublished manuscript.
11. Henzinger, T., Kopke, P., Puri, A., Varaiya, P. (1995). What's decidable about hybrid automata. Proceedings of the 27th ACM Symposium on the Theory of Computing.
12. Hopcroft, J. E., & Ullman, J. D. (1969). Formal Languages and their Relation to Automata. Reading, MA: Addison-Wesley.
13. Lagarias, J. C., & Wang, Y. (1995). The finiteness conjecture for the generalized spectral radius of a set of matrices. Linear Algebra Appl., 214, 17-42.
14. Matiyasevich, Y., & Sénizergues, G. (1996). Decision problems for semi-Thue systems with a few rules. Proceedings L1CS96, Computer Society Press, pp. 523-531.
15. Papadimitriou, C. H. (1994). Computational Complexity. Reading: Addison-Wesley.
16. Papadimitriou, C. H., & Tsitsiklis, J. N. (1987). The complexity of Markov decision processes. Math. Oper. Res., 12, 441-450.
17. Paterson, M. (1970). Unsolvability in 3 × 3 matrices. Studies Appl. Math. 49, 105-107.
18. Siegelmann, H., & Sontag, E. (1995). On the computational power of neural nets. J. Comput. Systems Sci., 50, 132-150.
19. Sontag, E. (1981). Nonlinear regulation: The piecewise linear approach. IEEE Trans. Automat. Control, 26, 346-358.
20. Sontag, E. (1995). From linear to nonlinear: Some complexity comparisons. Proc. IEEE Conf. Decision and Control, (pp. 2916-2920). New Orleans.
21. Sontag, E. (1996). Interconnected automata and linear systems: A theoretical framework in discrete-time. In R. Alur, T. Henzinger, E. D. Sontag (Eds.), Hybrid Systems III: Verification and Control. (pp. 436-448). Berlin: Springer.
22. Sontag, E. (1990). Mathematical Control Theory. New York: Springer.
23. Toker, O. (1996). On the algorithmic unsolvability of some stability problems for discrete event systems. Proceedings of IFAC World Congress (pp. 353-358).
24. Tsitsiklis, J. N., & Blondel, V. D. (1997). The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - When not impossible - To compute and to approximate. Math. Control Signals Systems, 10, 31-40.
25. Tsitsiklis, J. N., & Blondel, V. D. (1997). Lyapunov exponent of pairs of matrices, a connection. Math. Control Signal Systems, 10, 381.