{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T05:45:34Z","timestamp":1762321534981,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319114385"},{"type":"electronic","value":"9783319114392"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11439-2_2","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:30:11Z","timestamp":1410744611000},"page":"20-31","source":"Crossref","is-referenced-by-count":3,"title":["On The Complexity of Bounded Time Reachability for Piecewise Affine Systems"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Bazille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Bournez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walid","family":"Gomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Pouly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)90229-1","volume":"132","author":"P. Koiran","year":"1994","unstructured":"Koiran, P., Cosnard, M., Garzon, M.: Computability with low-dimensional dynamical systems. Theoretical Computer Science\u00a0132, 113\u2013128 (1994)","journal-title":"Theoretical Computer Science"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences\u00a057, 94\u2013124 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1088\/0951-7715\/4\/2\/002","volume":"4","author":"C. Moore","year":"1991","unstructured":"Moore, C.: Generalized shifts: unpredictability and undecidability in dynamical systems. Nonlinearity\u00a04, 199\u2013230 (1991)","journal-title":"Nonlinearity"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jcss.1995.1013","volume":"50","author":"H.T. Siegelmann","year":"1995","unstructured":"Siegelmann, H.T., Sontag, E.D.: On the computational power of neural nets. Journal of Computer and System Sciences\u00a050, 132\u2013150 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(94)00228-B","volume":"138","author":"E. Asarin","year":"1995","unstructured":"Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science\u00a0138, 35\u201365 (1995)","journal-title":"Theoretical Computer Science"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)90229-1","volume":"132","author":"P. Koiran","year":"1994","unstructured":"Koiran, P., Cosnard, M., Garzon, M.: Computability with Low-Dimensional Dynamical Systems. Theoretical Computer Science\u00a0132, 113\u2013128 (1994)","journal-title":"Theoretical Computer Science"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-45694-5_14","volume-title":"CONCUR 2002 - Concurrency Theory","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Schneider, G.: Widening the boundary between decidable and undecidable hybrid systems. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 193\u2013208. Springer, Heidelberg (2002)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-45351-2_11","volume-title":"Hybrid Systems: Computation and Control","author":"E. Asarin","year":"2001","unstructured":"Asarin, E., Schneider, G., Yovine, S.: On the decidability of the reachability problem for planar differential inclusions. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 89\u2013104. Springer, Heidelberg (2001)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-41036-9_6","volume-title":"Reachability Problems","author":"P. Bell","year":"2013","unstructured":"Bell, P., Chen, S.: Reachability problems for hierarchical piecewise constant derivative systems. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol.\u00a08169, pp. 46\u201358. Springer, Heidelberg (2013)"},{"key":"2_CR10","unstructured":"Ben-Amram, A.M.: Mortality of iterated piecewise affine functions over the integers: Decidability and complexity. In: STACS, pp. 514\u2013525 (2013)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.2000.1737","volume":"62","author":"V.D. Blondel","year":"2001","unstructured":"Blondel, V.D., Bournez, O., Koiran, P., Tsitsiklis, J.: The stability of saturated linear dynamical systems is undecidable. Journal of Computer and System Science\u00a062, 442\u2013462 (2001)","journal-title":"Journal of Computer and System Science"},{"key":"2_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co. (1979)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(93)00063-B","volume":"133","author":"P. Koiran","year":"1994","unstructured":"Koiran, P.: Computing over the reals with addition and order. Theor. Comput. Sci.\u00a0133, 35\u201347 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11439-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T08:28:35Z","timestamp":1674894515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11439-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114385","9783319114392"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11439-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}