{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:13Z","timestamp":1762291693831,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"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_11","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:01Z","timestamp":1762290841000},"page":"156-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nets-Within-Nets Through the\u00a0Lens of\u00a0Data Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5692-5681","authenticated-orcid":false,"given":"Francesco","family":"Di Cosmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5054-5664","authenticated-orcid":false,"given":"Soumodev","family":"Mal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1045-3033","authenticated-orcid":false,"given":"Tephilla","family":"Prince","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"11_CR1","unstructured":"Di Cosmo, F., Mal, S., Prince, T.: Deciding reachability and coverability in lossy EOS. In: International Workshop on Petri Nets and Software Engineering. CEUR Workshop Proceedings, vol.\u00a03730, pp. 74\u201395 (2024), https:\/\/ceur-ws.org\/Vol-3730\/paper04.pdf"},{"key":"11_CR2","unstructured":"Di Cosmo, F., Mal, S., Prince, T.: Nets-within-nets through the lens of data nets (2025). https:\/\/arxiv.org\/abs\/2506.22344"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Comput. Sci. 256(1-2), 63\u201392 (2001). https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000102X","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1\u20132), 1\u201329 (2004). https:\/\/doi.org\/10.1016\/J.IC.2004.01.005","DOI":"10.1016\/J.IC.2004.01.005"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc petri nets, data nets, and other enriched nets. In: 2012 27th Annual IEEE Symposium on Logic in Computer Science. pp. 355\u2013364 (2012). https:\/\/doi.org\/10.1109\/LICS.2012.46","DOI":"10.1109\/LICS.2012.46"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"K\u00f6hler-Bu\u00dfmeier, M.: A survey of decidability results for elementary object systems. Fundamenta Informaticae 130(1), 99\u2013123 (2014). https:\/\/doi.org\/10.3233\/FI-2014-983","DOI":"10.3233\/FI-2014-983"},{"key":"11_CR7","unstructured":"K\u00f6hler-Bussmeier, M., Capra, L.: Robustness: a natural definition based on nets-within-nets. In: Proceedings of the 2023 International Workshop on Petri Nets and Software Engineering. CEUR Workshop Proceedings, vol.\u00a03430, pp. 70\u201387 (2023). https:\/\/ceur-ws.org\/Vol-3430\/paper5.pdf"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"K\u00f6hler-Bu\u00dfmeier, M., R\u00f6lke, H.: Analysing adaption processes of hornets. Trans. Petri Nets Other Model. Concurr. 17, 84\u2013107 (2023). https:\/\/doi.org\/10.1007\/978-3-662-68191-6_4","DOI":"10.1007\/978-3-662-68191-6_4"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Lazic, R., Newcomb, T.C., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Informaticae 88(3), 251\u2013274 (2008). https:\/\/doi.org\/10.5555\/1497079.1497082","DOI":"10.5555\/1497079.1497082"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Lazic, R., Schmitz, S.: The complexity of coverability in $$\\nu $$-petri nets. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, July 5-8, 2016, pp. 467\u2013476. ACM, New York (2016)","DOI":"10.1145\/2933575.2933593"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Lomazova, I.A.: Nested petri nets - a formalism for specification and verification of multi-agent distributed systems. Fundam. Informaticae 43(1-4), 195\u2013214 (2000). https:\/\/doi.org\/10.3233\/FI-2000-43123410","DOI":"10.3233\/FI-2000-43123410"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested petri nets. In: Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference. LNCS, vol.\u00a01755, pp. 208\u2013220. Springer (1999), https:\/\/doi.org\/10.1007\/3-540-46562-6_18","DOI":"10.1007\/3-540-46562-6_18"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: Properties, analysis and applications. IEEE 77(4), 541\u2013580 (1989). https:\/\/doi.org\/10.1109\/5.24143","journal-title":"IEEE"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ic.2017.02.002","volume":"254","author":"F Rosa-Velardo","year":"2017","unstructured":"Rosa-Velardo, F.: Ordinal recursive complexity of unordered data nets. Inf. Comput. 254, 41\u201358 (2017)","journal-title":"Inf. Comput."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Rosa-Velardo, F., de\u00a0Frutos-Escrig, D.: Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439\u20134451 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.007","DOI":"10.1016\/j.tcs.2011.05.007"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Schmitz, S., Schnoebelen, P.: Multiply-recursive upper bounds with higman\u2019s lemma. In: Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II. LNCS, vol.\u00a06756, pp. 441\u2013452. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_35","DOI":"10.1007\/978-3-642-22012-8_35"},{"key":"11_CR17","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic aspects of wqo theory (2012)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Valk, R.: Object petri nets: using the nets-within-nets paradigm. In: Lectures on Concurrency and Petri Nets, Advances in Petri Nets. LNCS, vol.\u00a03098, pp. 819\u2013848. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_23","DOI":"10.1007\/978-3-540-27755-2_23"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:04Z","timestamp":1762290844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}