Complexity of stability and controllability of elementary hybrid systems
暂无分享,去创建一个
[1] John N. Tsitsiklis,et al. A survey of computational complexity results in systems and control , 2000, Autom..
[2] J. Tsitsiklis,et al. Overview of complexity and decidability results for three classes of elementary nonlinear systems , 1999 .
[3] John N. Tsitsiklis,et al. When is a Pair of Matrices Mortal? , 1997, Inf. Process. Lett..
[4] John N. Tsitsiklis,et al. The Lyapunov exponent and joint spectral radius of pairs of matrices are hard—when not impossible—to compute and to approximate , 1997, Math. Control. Signals Syst..
[5] Olivier Bournez,et al. On the Computational Power of Dynamical Systems and Hybrid Systems , 1996, Theor. Comput. Sci..
[6] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[7] O. Toker. On the Algorithmic Unsolvability of Some Stability Problems for Discrete Event Systems , 1996 .
[8] Eduardo D. Sontag,et al. Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time , 1996, Hybrid Systems.
[9] Eduardo Sontag. From linear to nonlinear: some complexity comparisons , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.
[10] L. Gurvits. Stability of discrete linear inclusion , 1995 .
[11] Pravin Varaiya,et al. What's decidable about hybrid automata? , 1995, STOC '95.
[12] Amir Pnueli,et al. Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..
[13] Michael S. Branicky,et al. Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems , 1995, Theor. Comput. Sci..
[14] J. Lagarias,et al. The finiteness conjecture for the generalized spectral radius of a set of matrices , 1995 .
[15] Hava T. Siegelmann,et al. On the computational power of neural nets , 1992, COLT '92.
[16] I. Daubechies,et al. Sets of Matrices All Infinite Products of Which Converge , 1992 .
[17] Eduardo D. Sontag,et al. Mathematical control theory: deterministic systems , 1990 .
[18] Eduardo D. Sontag,et al. Mathematical Control Theory: Deterministic Finite Dimensional Systems , 1990 .
[19] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[20] Eduardo Sontag. Nonlinear regulation: The piecewise linear approach , 1981 .
[21] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[22] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[23] M. Paterson. Unsolvability in 3 × 3 Matrices , 1970 .
[24] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.