{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:05Z","timestamp":1725488525473},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_40","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"479-490","source":"Crossref","is-referenced-by-count":4,"title":["The Stability of Saturated Linear Dynamical Systems Is Undecidable"],"prefix":"10.1007","author":[{"given":"Vincent D.","family":"Blondel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Bournez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Koiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John N.","family":"Tsitsiklis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3\u201334, 6 February 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(94)00228-B","volume":"138","author":"E. Asarin","year":"1995","unstructured":"E. Asarin, O. Maler, and A. Pnueli. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138(1):35\u201365, February 1995.","journal-title":"Theoretical Computer Science"},{"key":"40_CR3","unstructured":"V. D. Blondel, O. Bournez, P. Koiran, C. Papadimitriou, and J. N. Tsitsiklis. Deciding stability and mortality of piecewise affine dynamical systems. Submitted. Available from http:\/\/www.inma.ucl.ac.be\/~blondel\/publications ."},{"key":"40_CR4","unstructured":"V. D. Blondel, O. Bournez, P. Koiran, and J. N. Tsitsiklis. The stability of saturated linear dynamical systems is undecidable. Submitted. Available from http:\/\/www.inma.ucl.ac.be\/~blondel\/publications ."},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/S0005-1098(98)00175-7","volume":"35","author":"V. D. Blondel","year":"1999","unstructured":"V. D. Blondel and J. N. Tsitsiklis. Complexity of stability and controllability of elementary hybrid systems. Automatica, 35(3), 479\u2013489, 1999.","journal-title":"Automatica"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0109720","volume-title":"Learning, Control and Hybrid Systems","author":"V. D. Blondel","year":"1999","unstructured":"V. D. Blondel and J. N. Tsitsiklis. Overview of complexity and decidability results for three classes of elementary nonlinear systems. In Y. Yamamoto and S. Hara, editors, Learning, Control and Hybrid Systems, pages 46\u201358. Springer-Verlag, London, 1999."},{"key":"40_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-1-4471-0807-8_11","volume-title":"Open Problems in Mathematical Systems and Control Theory","author":"V. D. Blondel","year":"1999","unstructured":"V. D. Blondel and J. N. Tsitsiklis. Three problems on the decidability and complexity of stability. In V. D. Blondel, E. D. Sontag, M. Vidyasagar, and J. C. Willems, editors, Open Problems in Mathematical Systems and Control Theory, pages 45\u201352. Springer-Verlag, London, 1999."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control. To appear in Automatica, 1999.","DOI":"10.1016\/S0005-1098(00)00050-9"},{"key":"40_CR9","unstructured":"O. Bournez. Complexit\u00e9 algorithmique des syst\u00e8mes dynamiques continus et hybrides. PhD Thesis, Ecole Normale Sup\u00e9rieure de Lyon, 1999."},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-0701-6"},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1\u201346, July 1989.","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T. A. Henzinger","year":"1998","unstructured":"T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences, 57(1):94\u2013124, August 1998.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.2307\/2269811","volume":"31","author":"P. K. Hooper","year":"1966","unstructured":"P. K. Hooper. The undecidability of the Turing machine immortality problem. The Journal of Symbolic Logic, 31(2): 219\u2013234, June 1966.","journal-title":"The Journal of Symbolic Logic"},{"key":"40_CR14","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley, October 1979."},{"issue":"1\u20132","key":"40_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)90229-1","volume":"132","author":"P. Koiran","year":"1994","unstructured":"P. Koiran, M. Cosnard, and M. Garzon. Computability with low-dimensional dynamical systems. Theoretical Computer Science, 132(1\u20132):113\u2013128, September 1994.","journal-title":"Theoretical Computer Science"},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1088\/0951-7715\/4\/2\/002","volume":"4","author":"C. Moore","year":"1991","unstructured":"C. Moore. Generalized shifts: unpredictability and undecidability in dynamical systems. Nonlinearity, 4:199\u2013230, 1991.","journal-title":"Nonlinearity"},{"issue":"2","key":"40_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","volume":"131","author":"H. T. Siegelmann","year":"1994","unstructured":"H. T. Siegelmann and E. D. Sontag. Analog computation via neural networks. Theoretical Computer Science, 131(2):331\u2013360, September 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"40_CR18","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jcss.1995.1013","volume":"50","author":"H. T. Siegelmann","year":"1995","unstructured":"H. T. Siegelmann and E. D. Sontag. On the computational power of neural nets. Journal of Computer and System Sciences, 50(1):132\u2013150, February 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"E. D. Sontag. From linear to nonlinear: Some complexity comparisons. In IEEE Conference on Decision and Control, pages 2916\u20132920, New Orleans, December 1995.","DOI":"10.1109\/CDC.1995.478585"},{"key":"40_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020966","volume-title":"Hybrid Systems III","author":"E. D. Sontag","year":"1996","unstructured":"E. D. Sontag. Interconnected automata and linear systems: A theoretical frame-work in discrete time. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science. Springer-Verlag, 1996."},{"key":"40_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0577-7","volume-title":"Mathematical Control Theory: Deterministic Finite Dimensional Systems","author":"E. D. Sontag","year":"1998","unstructured":"E. D. Sontag. Mathematical Control Theory: Deterministic Finite Dimensional Systems. Springer-Verlag, New York, second edition, August 1998.","edition":"second edition"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T03:15:09Z","timestamp":1629515709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}