{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T10:37:38Z","timestamp":1768214258426,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156990","type":"print"},{"value":"9783032157003","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-15700-3_2","type":"book-chapter","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:21:43Z","timestamp":1768202503000},"page":"21-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability in\u00a0Multi-agent Transfer Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9957-5394","authenticated-orcid":false,"given":"Nathalie","family":"Bertrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7056-2672","authenticated-orcid":false,"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0875-300X","authenticated-orcid":false,"given":"Engel","family":"Lefaucheux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1134-000X","authenticated-orcid":false,"given":"Luca","family":"Paparazzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,13]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T Araki","year":"1976","unstructured":"Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theoret. Comput. Sci. 3(1), 85\u2013104 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR2","unstructured":"Bertrand, N., H\u00e9lou\u00ebt, L., Lefaucheux, E., Paparazzo, L.: Reachability in multi-agent transfer systems (extended version). Technical report, HAL Inria https:\/\/inria.hal.science\/hal-05366409 (2025)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-14162-1_40","volume-title":"Automata, Languages and Programming","author":"T Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Jan\u010dar, P., Ku\u010dera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 478\u2013489. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_40"},{"key":"2_CR4","unstructured":"Brihaye, T., Bruy\u00e9re, V., Goeminne, A., Raskin, J.F., Van den Bogaard, M.: The complexity of subgame perfect equilibria in quantitative reachability games. In: Proceedings of the 30th International Conference on Concurrency Theory (CONCUR\u201919), volume 140 of LIPIcs, pp. 13:1\u201313:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Brihaye, T., Dhar, A.K., Geeraerts, G., Haddad, A., Monmege, B.: Efficient energy distribution in a smart grid using multi-player games. In: Proceedings of Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (Cassting\/SynCoP\u201916), volume 220 of EPTCS, pp. 1\u201312, (2016)","DOI":"10.4204\/EPTCS.220.1"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s10458-021-09531-9","volume":"36","author":"N Bulling","year":"2022","unstructured":"Bulling, N., Goranko, V.: Combining quantitative and qualitative reasoning in concurrent multi-player games. Auton. Agent. Multi-Agent Syst. 36(1), 2 (2022)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"1 &2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theor. Comput. Sci. 147(1 &2), 117\u2013136 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Ciardo, G.: Petri Nets with Marking-Dependent Arc Cardinality: Properties and Analysis, pp. 179\u2013198. Springer (1994)","DOI":"10.1007\/3-540-58152-9_11"},{"issue":"1\u20132","key":"2_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(97)00235-1","volume":"198","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Reachability in live and safe free-choice Petri nets is NP-complete. Theoret. Comput. Sci. 198(1\u20132), 211\u2013224 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23283-1_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"U Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy Games in Multiweighted Automata. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 95\u2013115. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23283-1_9"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Felner, A., et al.: Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges. In: Proceedings of the 10th International Symposium on Combinatorial Search (SOCS\u201917), pp. 29\u201337. AAAI Press (2017)","DOI":"10.1609\/socs.v8i1.18423"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00236-020-00385-4","volume":"58","author":"J Gutierrez","year":"2021","unstructured":"Gutierrez, J., Murano, A., Perelli, G., Rubin, S., Steeples, T., Wooldridge, M.J.: Equilibria for games with combined qualitative and quantitative objectives. Acta Informatica 58(6), 585\u2013610 (2021)","journal-title":"Acta Informatica"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-04081-8_25","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C Haase","year":"2009","unstructured":"Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 369\u2013383. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_25"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoret. Comput. Sci. 8, 135\u2013159 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR15","first-page":"85","volume-title":"Reducibility Among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems, pp. 85\u2013103. Springer (1972)"},{"key":"2_CR16","unstructured":"K\u00fcnnemann, M., Mazowiecki, F., Sch\u00fctze, L., Sinclair-Banks, H., Wegrzycki, K.: Coverability in VASS revisited: Improving Rackoff\u2019s bound to obtain conditional optimality. In: Proceeding of the 50th International Colloquium on Automata, Languages, and Programming (ICALP\u201923), volume 261 of LIPIcs, pages 131:1\u2013131:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"2_CR17","unstructured":"Leroux, J.: In: Petri net reachability problem (invited talk). Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik (2019)"},{"key":"2_CR18","volume-title":"The Reachability Problem Requires Exponential Space","author":"R Lipton","year":"1976","unstructured":"Lipton, R.: The Reachability Problem Requires Exponential Space. Yale University (1976). Technical report"},{"key":"2_CR19","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Inc, Upper Saddle River, NJ, USA (1967)"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci. 6, 223\u2013231 (1978)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting ackermann-hardness for lossy counter machines and reset petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616\u2013628. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_54"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15700-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:21:46Z","timestamp":1768202506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15700-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156990","9783032157003"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15700-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/VMCAI-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}