{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:22:54Z","timestamp":1762298574892,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032095237"},{"type":"electronic","value":"9783032095244"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09524-4_6","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:00Z","timestamp":1762290840000},"page":"83-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability and\u00a0Mortality for\u00a0Two-Dimensional RHPCD Systems Are co-NP-hard"],"prefix":"10.1007","author":[{"given":"Olga","family":"Tveretina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"issue":"1","key":"6_CR1","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. Theoret. Comput. Sci. 138(1), 35\u201365 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR2","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. Inf. Comput. 211, 138\u2013159 (2012)","journal-title":"Inf. Comput."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-11439-2_2","volume-title":"Reachability Problems","author":"H Bazille","year":"2014","unstructured":"Bazille, H., Bournez, O., Gomaa, W., Pouly, A.: On the complexity of bounded time reachability for piecewise affine systems. In: Ouaknine, J., Potapov, I., Worrell, J. (eds.) RP 2014. LNCS, vol. 8762, pp. 20\u201331. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11439-2_2"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2016.09.003","volume":"652","author":"PC Bell","year":"2016","unstructured":"Bell, P.C., Chen, S., Jackson, L.: On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theoret. Comput. Sci. 652, 47\u201363 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR5","unstructured":"Bell, P.C., Potapov, I., Semukhin, P.: On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, 26\u201330 August 2019, Aachen, Germany. LIPIcs, vol.\u00a0138, pp. 83:1\u201383:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR6","unstructured":"Ben-Amram, A.M.: Mortality of iterated piecewise affine functions over the integers: Decidability and complexity (extended abstract). In: Portier, N., Wilke, T. (eds.) 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Germany. LIPIcs, vol.\u00a020, pp. 514\u2013525. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013)"},{"key":"6_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge, MA (2009)","edition":"3"},{"key":"6_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, NY, USA (1979)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"TA Henzinger","year":"1998","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? J. Comput. Syst. Sci. 57(1), 94\u2013124 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Lafferriere, G., Pappas, G., Yovine, S.: A new class of decidable hybrid systems. In: Hybrid Systems: Computation and Control, Second International Workshop, pp. 137\u2013151 (1999)","DOI":"10.1007\/3-540-48983-5_15"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Maler, O., Pnueli, A.: Reachability analysis of planar multi-linear systems. In: CAV, pp. 194\u2013209 (1993)","DOI":"10.1007\/3-540-56922-7_17"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"de\u00a0Oliveira\u00a0Oliveira, M., Tveretina, O.: Mortality and edge-to-edge reachability are decidable on surfaces. In: 25th ACM International Conference on Hybrid Systems: Computation and Control (2022)","DOI":"10.1145\/3501710.3519529"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-030-30806-3_14","volume-title":"Reachability Problems","author":"A Sandler","year":"2019","unstructured":"Sandler, A., Tveretina, O.: Deciding reachability for piecewise constant derivative systems on orientable manifolds. In: Filiot, E., Jungers, R., Potapov, I. (eds.) RP 2019. LNCS, vol. 11674, pp. 178\u2013192. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30806-3_14"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pp.\u00a01\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcss.1995.1009","volume":"50","author":"K Sutner","year":"1995","unstructured":"Sutner, K.: On the computational complexity of finite cellular automata. J. Comput. Syst. Sci. 50(1), 87 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Tveretina, O.: On the complexity of reachability and mortality for bounded piecewise affine maps. In: Kov\u00e1cs, L., Sokolova, A. (eds.) Reachability Problems - 18th International Conference, RP 2024. LNCS, vol. 15050, pp. 141\u2013153. Springer (2024)","DOI":"10.1007\/978-3-031-72621-7_10"}],"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-032-09524-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:17:46Z","timestamp":1762298266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}