{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:00Z","timestamp":1759639080861,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_3","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:30:11Z","timestamp":1410744611000},"page":"32-44","source":"Crossref","is-referenced-by-count":0,"title":["Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Bell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science\u00a0138(1), 3\u201334 (1995)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","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":"3_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ic.2011.11.006","volume":"211","author":"E. Asarin","year":"2012","unstructured":"Asarin, E., Mysore, V., Pnueli, A., Schneider, G.: Low dimensional hybrid systems - decidable, undecidable, don\u2019t know. Information and Computation\u00a0211, 138\u2013159 (2012)","journal-title":"Information and Computation"},{"key":"3_CR4","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":"3_CR5","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.C. Bell","year":"2013","unstructured":"Bell, P.C., 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)"},{"issue":"1-2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0304-3975(00)00399-6","volume":"255","author":"V.D. Blondel","year":"2001","unstructured":"Blondel, V.D., Bournez, O., Koiran, P., Papadimitriou, C., Tsitsiklis, J.N.: Deciding stability and mortality of piecewise affine dynamical systems. Theoretical Computer Science\u00a0255(1-2), 687\u2013696 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theoretical Computer Science\u00a0321(2), 291\u2013345 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Kopka, P., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? In: 27th ACM STOC, pp. 373\u2013382. ACM Press (1995)","DOI":"10.1145\/225058.225162"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-46430-1_15","volume-title":"Hybrid Systems: Computation and Control","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.\u00a01790, pp. 145\u2013159. Springer, Heidelberg (2000)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-56922-7_17","volume-title":"Computer Aided Verification","author":"O. Maler","year":"1993","unstructured":"Maler, O., Pnueli, A.: Reachability analysis of planar multi-linear systems. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 194\u2013209. Springer, Heidelberg (1993)"},{"key":"3_CR12","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall International, Englewood Cliffs (1967)"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:05:58Z","timestamp":1676891158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11439-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114385","9783319114392"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11439-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}