{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:08:53Z","timestamp":1742998133799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562211"},{"type":"electronic","value":"9783031562228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56222-8_10","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T08:02:30Z","timestamp":1710835350000},"page":"172-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Home-Space Problem for\u00a0Petri Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8738-9850","authenticated-orcid":false,"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7214-9467","authenticated-orcid":false,"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ipl.2016.01.011","volume":"116","author":"E Best","year":"2016","unstructured":"Best, E., Esparza, J.: Existence of home states in petri nets is decidable. Inf. Process. Lett. 116(6), 423\u2013427 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2016.01.011","journal-title":"Inf. Process. Lett."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Czerwinski, W., Orlikowski, L.: Reachability in vector addition systems is Ackermann-complete. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7\u201310, 2022, pp. 1229\u20131240. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00120","DOI":"10.1109\/FOCS52979.2021.00120"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-63141-0_15","volume-title":"CONCUR 1997: Concurrency Theory","author":"L Fribourg","year":"1997","unstructured":"Fribourg, L., Ols\u00e9n, H.: Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 213\u2013227. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63141-0_15"},{"key":"10_CR4","unstructured":"de Frutos Escrig, D., Johnen, C.: Decidability of home space property. Univ. de Paris-Sud, Centre d\u2019Orsay, Laboratoire de Recherche en Informatique, LRI-503 (1989)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas and languages. Pac. J. Math. 16(2), 285\u2013296 (1966). https:\/\/doi.org\/10.2140\/pjm.1966.16.285","journal-title":"Pac. J. Math."},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/3242953.3242964","volume":"5","author":"C Haase","year":"2018","unstructured":"Haase, C.: A survival guide to Presburger arithmetic. ACM SIGLOG News 5(3), 67\u201382 (2018). https:\/\/doi.org\/10.1145\/3242953.3242964","journal-title":"ACM SIGLOG News"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Jan\u010dar, P., Leroux, J.: The semilinear home-space problem is Ackermann-complete for Petri nets. In: P\u00e9rez, G.A., Raskin, J. (eds.) 34th International Conference on Concurrency Theory, CONCUR 2023, September 18\u201323, 2023, Antwerp, Belgium. LIPIcs, vol. 279, pp. 36:1\u201336:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2023.36","DOI":"10.4230\/LIPICS.CONCUR.2023.36"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Leroux, J.: The general vector addition system reachability problem by Presburger inductive invariants. Log. Methods Comput. Sci. 6(3), 1\u201325 (2010). https:\/\/doi.org\/10.2168\/LMCS-6(3:22)2010","DOI":"10.2168\/LMCS-6(3:22)2010"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Leroux, J.: Presburger vector addition systems. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25\u201328, 2013, pp. 23\u201332. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/LICS.2013.7","DOI":"10.1109\/LICS.2013.7"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Leroux, J.: The reachability problem for Petri nets is not primitive recursive. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7\u201310, 2022, pp. 1241\u20131252. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00121","DOI":"10.1109\/FOCS52979.2021.00121"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Leroux, J., Schmitz, S.: Reachability in vector addition systems is primitive-recursive in fixed dimension. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24\u201327, 2019, pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785796","DOI":"10.1109\/LICS.2019.8785796"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(78)90021-1","volume":"16","author":"DC Oppen","year":"1978","unstructured":"Oppen, D.C.: A 2$$\\hat{\\,}$$2$$\\hat{\\,}$$2$$\\hat{\\,}$$pn upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci. 16(3), 323\u2013332 (1978). https:\/\/doi.org\/10.1016\/0022-0000(78)90021-1","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Taming the Infinities of Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56222-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T22:03:16Z","timestamp":1730930596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56222-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562211","9783031562228"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56222-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}}]}}