{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T05:51:57Z","timestamp":1762321917258,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Research Council of Norway","award":["288761 and 326537"],"award-info":[{"award-number":["288761 and 326537"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,4]]},"DOI":"10.1145\/3501710.3519529","type":"proceedings-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T14:28:32Z","timestamp":1651156112000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Mortality and Edge-to-Edge Reachability are Decidable on Surfaces"],"prefix":"10.1145","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[{"name":"University of Bergen, Norway"}]},{"given":"Olga","family":"Tveretina","sequence":"additional","affiliation":[{"name":"University of Hertfordshire, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In Hybrid Systems. 209\u2013229.","author":"Alur R.","year":"1992","unstructured":"R. Alur , C. Courcoubetis , T.\u00a0 A. Henzinger , and P.-H. Ho . 1992 . Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In Hybrid Systems. 209\u2013229. R. Alur, C. Courcoubetis, T.\u00a0A. Henzinger, and P.-H. Ho. 1992. Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In Hybrid Systems. 209\u2013229."},{"key":"e_1_3_2_1_2_1","unstructured":"G. Ananthakrishna A. Conway E. Ergin D. Kosanovic C. Kremer I. Nonino and B. Ruppik. 2021. Lecture Notes on Topological Manifolds. https:\/\/maths.dur.ac.uk\/users\/mark.a.powell\/topological-manifolds-lecture-notes.pdf.  G. Ananthakrishna A. Conway E. Ergin D. Kosanovic C. Kremer I. Nonino and B. Ruppik. 2021. Lecture Notes on Topological Manifolds. https:\/\/maths.dur.ac.uk\/users\/mark.a.powell\/topological-manifolds-lecture-notes.pdf."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1969v009n03ABEH001130"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.11.006"},{"volume-title":"CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. 193\u2013208","author":"Asarin E.","key":"e_1_3_2_1_5_1","unstructured":"E. Asarin and G. Schneider . 2002. Widening the Boundary between Decidable and Undecidable Hybrid Systems . In CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. 193\u2013208 . E. Asarin and G. Schneider. 2002. Widening the Boundary between Decidable and Undecidable Hybrid Systems. In CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. 193\u2013208."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.03.055"},{"volume-title":"RP 2014. Proceedings(LNCS, Vol.\u00a08762)","author":"Bazille H.","key":"e_1_3_2_1_7_1","unstructured":"H. Bazille , O. Bournez , W. Gomaa , and A. Pouly . 2014. On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. In Reachability Problems - 8th International Workshop , RP 2014. Proceedings(LNCS, Vol.\u00a08762) , J.\u00a0Ouaknine, I.\u00a0Potapov, and J.\u00a0Worrell (Eds.). Springer, 20\u201331. H. Bazille, O. Bournez, W. Gomaa, and A. Pouly. 2014. On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. In Reachability Problems - 8th International Workshop, RP 2014. Proceedings(LNCS, Vol.\u00a08762), J.\u00a0Ouaknine, I.\u00a0Potapov, and J.\u00a0Worrell (Eds.). Springer, 20\u201331."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.09.003"},{"key":"e_1_3_2_1_9_1","volume-title":"44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019","author":"Bell C.","year":"2019","unstructured":"P.\u00a0 C. Bell , I. Potapov , and P. Semukhin . 2019. 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 , August 26-30, 2019 , Aachen, Germany(LIPIcs, Vol.\u00a0138), P.\u00a0Rossmanith, P.\u00a0Heggernes, and J.-P. Katoen (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 83:1\u201383:15. P.\u00a0C. Bell, I. Potapov, and P. Semukhin. 2019. 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, August 26-30, 2019, Aachen, Germany(LIPIcs, Vol.\u00a0138), P.\u00a0Rossmanith, P.\u00a0Heggernes, and J.-P. Katoen (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 83:1\u201383:15."},{"key":"e_1_3_2_1_10_1","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science, STACS","author":"Ben-Amram M.","year":"2013","unstructured":"A.\u00a0 M. Ben-Amram . 2013 . Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract) . In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Germany(LIPIcs, Vol.\u00a020), N.\u00a0Portierand T.\u00a0Wilke (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 514\u2013525. A.\u00a0M. Ben-Amram. 2013. Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Germany(LIPIcs, Vol.\u00a020), N.\u00a0Portierand T.\u00a0Wilke (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 514\u2013525."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00399-6"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"What\u2019s Decidable About Hybrid Automata?J","volume":"57","author":"Henzinger A.","year":"1998","unstructured":"T.\u00a0 A. Henzinger , P.\u00a0 W. Kopke , A. Puri , and P. Varaiya . 1998 . What\u2019s Decidable About Hybrid Automata?J . Comput. System Sci. 57 , 1 (Aug. 1998), 94\u2013124. T.\u00a0A. Henzinger, P.\u00a0W. Kopke, A. Puri, and P. Varaiya. 1998. What\u2019s Decidable About Hybrid Automata?J. Comput. System Sci. 57, 1 (Aug. 1998), 94\u2013124.","journal-title":"Comput. System Sci."},{"key":"e_1_3_2_1_13_1","unstructured":"P. Koiran. 1999. My favourite problems. http:\/\/perso.ens-lyon.fr\/pascal.koiran\/problems.html.  P. Koiran. 1999. My favourite problems. http:\/\/perso.ens-lyon.fr\/pascal.koiran\/problems.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2802864.2802987"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108006054"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"O. Maler and A. Pnueli. 1993. Reachability Analysis of Planar Multi-linear Systems. In CAV. 194\u2013209.  O. Maler and A. Pnueli. 1993. Reachability Analysis of Planar Multi-linear Systems. In CAV. 194\u2013209.","DOI":"10.1007\/3-540-56922-7_17"},{"key":"e_1_3_2_1_17_1","first-page":"71","article-title":"Trajectories on the Closed Orientable Surfaces","author":"Mayer A.","year":"1943","unstructured":"A. Mayer . 1943 . Trajectories on the Closed Orientable Surfaces . Rec. Math. [Mat. Sbornik] N. S. 12(54):1 (1943), 71 \u2013 84 . A. Mayer. 1943. Trajectories on the Closed Orientable Surfaces. Rec. Math. [Mat. Sbornik] N.S. 12(54):1 (1943), 71\u201384.","journal-title":"Rec. Math. [Mat. Sbornik] N."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"V. Mysore and A. Pnueli. 2005. Refining the Undecidability Frontier of Hybrid Automata. In FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 25th International Conference Proceedings(LNCS Vol.\u00a03821) R.\u00a0Ramanujam and S.\u00a0Sen (Eds.). Springer 261\u2013272.  V. Mysore and A. Pnueli. 2005. Refining the Undecidability Frontier of Hybrid Automata. In FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 25th International Conference Proceedings(LNCS Vol.\u00a03821) R.\u00a0Ramanujam and S.\u00a0Sen (Eds.). Springer 261\u2013272.","DOI":"10.1007\/11590156_21"},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"Suites \u00e0 termes dans un alphabet fini. In Seminar on number theory (1982-1983), University of Bordeaux I","volume":"25","author":"Rauzy G.","year":"1983","unstructured":"G. Rauzy . 1983 . Suites \u00e0 termes dans un alphabet fini. In Seminar on number theory (1982-1983), University of Bordeaux I , Talence , 25. 1 \u2013 16 . G. Rauzy. 1983. Suites \u00e0 termes dans un alphabet fini. In Seminar on number theory (1982-1983), University of Bordeaux I, Talence, 25. 1 \u2013 16.","journal-title":"Talence"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the Royal Society A 137(2)","author":"B.","year":"2016","unstructured":"Fornberg\u00a0 B. Reeger J.\u00a0A. and Watts\u00a0M. L.2016. Numerical quadrature over smooth, closed surfaces . Proceedings of the Royal Society A 137(2) ( 2016 ), 174 \u2013 188. Fornberg\u00a0B. Reeger J.\u00a0A. and Watts\u00a0M. L.2016. Numerical quadrature over smooth, closed surfaces. Proceedings of the Royal Society A 137(2) (2016), 174 \u2013 188."},{"volume-title":"RP 2019, Proceedings(LNCS, Vol.\u00a011674)","author":"Sandler A.","key":"e_1_3_2_1_21_1","unstructured":"A. Sandler and O. Tveretina . 2019. Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds. In Reachability Problems - 13th International Conference , RP 2019, Proceedings(LNCS, Vol.\u00a011674) , E.\u00a0Filiot, R.\u00a0M. Jungers, and I.\u00a0Potapov (Eds.). Springer, 178\u2013192. A. Sandler and O. Tveretina. 2019. Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds. In Reachability Problems - 13th International Conference, RP 2019, Proceedings(LNCS, Vol.\u00a011674), E.\u00a0Filiot, R.\u00a0M. Jungers, and I.\u00a0Potapov (Eds.). Springer, 178\u2013192."},{"key":"e_1_3_2_1_22_1","unstructured":"G. Schneider. 2002. Algorithmic analysis of polygonal hybrid systems. Ph.\u00a0D. Dissertation. VERIMAG.  G. Schneider. 2002. Algorithmic analysis of polygonal hybrid systems. Ph.\u00a0D. Dissertation. VERIMAG."},{"key":"e_1_3_2_1_23_1","volume-title":"16th International Conference, CAV 2004, Proceedings(LNCS, Vol.\u00a03114)","author":"Tiwari A.","year":"2004","unstructured":"A. Tiwari . 2004 . Termination of Linear Programs. In Computer Aided Verification , 16th International Conference, CAV 2004, Proceedings(LNCS, Vol.\u00a03114) , R.\u00a0Alurand D.\u00a0A. Peled (Eds.). Springer, 70\u201382. A. Tiwari. 2004. Termination of Linear Programs. In Computer Aided Verification, 16th International Conference, CAV 2004, Proceedings(LNCS, Vol.\u00a03114), R.\u00a0Alurand D.\u00a0A. Peled (Eds.). Springer, 70\u201382."},{"key":"e_1_3_2_1_24_1","unstructured":"M. von Wunsch. 2021. Counting Topological Manifolds Lecture Notes. https:\/\/maths.dur.ac.uk\/users\/mark.a.powell\/topological-manifolds-lecture-notes.pdff.  M. von Wunsch. 2021. Counting Topological Manifolds Lecture Notes. https:\/\/maths.dur.ac.uk\/users\/mark.a.powell\/topological-manifolds-lecture-notes.pdff."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.115"}],"event":{"name":"HSCC '22: 25th ACM International Conference on Hybrid Systems: Computation and Control","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Milan Italy","acronym":"HSCC '22"},"container-title":["25th ACM International Conference on Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501710.3519529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3501710.3519529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:11Z","timestamp":1750183811000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501710.3519529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":25,"alternative-id":["10.1145\/3501710.3519529","10.1145\/3501710"],"URL":"https:\/\/doi.org\/10.1145\/3501710.3519529","relation":{},"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"2022-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}