{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T00:05:24Z","timestamp":1780358724906,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032278784","type":"print"},{"value":"9783032278791","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-27879-1_13","type":"book-chapter","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:06:48Z","timestamp":1780355208000},"page":"267-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Safety Analysis in\u00a0Broadcast Networks Defined by\u00a0Graph Grammars"],"prefix":"10.1007","author":[{"given":"Christoffer Lind","family":"Andersen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Radu","family":"Iosif","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Sangnier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS\u201996, LICS \u201996, page 313, USA. IEEE Computer Society (1996)","DOI":"10.1109\/LICS.1996.561359"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00446-017-0302-6","volume":"31","author":"B Aminof","year":"2018","unstructured":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of rendezvous systems. Distrib. Comput. 31(3), 187\u2013222 (2018)","journal-title":"Distrib. Comput."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00446-017-0302-6","volume":"31","author":"B Aminof","year":"2018","unstructured":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of rendezvous systems. Distributed Comput. 31(3), 187\u2013222 (2018)","journal-title":"Distributed Comput."},{"key":"13_CR4","unstructured":"Andersen, C.L., Iosif, R., Sangnier, A.: Safety analysis in broadcast networks defined by graph grammars. Technical report, VERIMAG (2026). https:\/\/hal.science\/hal-05528808"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bloem, R., et al.: Decidability of parameterized verification. In: Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2015)","DOI":"10.1007\/978-3-031-02011-7"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bozga, M., Iosif, R., Sangnier, A., Villani, N.: Counting abstraction and decidability for the verification of structured parameterized networks. In: Piskac, R., Rakamari\u0107, Z. (eds.) CAV\u201925. LNCS, vol. 15933, pp. 238\u2013262. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-98682-6_13","DOI":"10.1007\/978-3-031-98682-6_13"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0890-5401(89)90026-6","volume":"81","author":"MC Browne","year":"1989","unstructured":"Browne, M.C., Clarke, E.M., Grumberg, O.: Reasoning about networks with many identical finite state processes. Inf. Comput. 81(1), 13\u201331 (1989)","journal-title":"Inf. Comput."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Encyclopedia of Mathematics and its Applications. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"13_CR9","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: FSTTCS\u201912, volume 18 of LIPIcs, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313\u2013327. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_22"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-19805-2_30","volume-title":"Foundations of Software Science and Computational Structures","author":"G Delzanno","year":"2011","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 441\u2013455. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19805-2_30"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Engelfriet, J.: Context-Free Graph Grammars, pp. 125\u2013213. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59126-6_3"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS\u201999, p. 352, USA. IEEE Computer Society (1999)","DOI":"10.1109\/LICS.1999.782630"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"J. Esparza and M. Nielsen. Decidability issues for Petri nets - a survey. Elektronische Informationsverarbeitung und Kybernetik 30, 143\u2013160 (1994)","DOI":"10.7146\/brics.v1i8.21662"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992)","DOI":"10.1145\/146637.146681"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Guillou, L., Sangnier, A., Sznajder, N.: Safety verification of wait-only non-blocking broadcast protocols. In: Kristensen, L.M., van der Werf, J.M. (eds.) PETRI NETS 2024, pp. 291\u2013311. LNCS, vol. 14628. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-61433-0_14","DOI":"10.1007\/978-3-031-61433-0_14"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Iosif, R., Sangnier, A., Villani, N.: Verifying parameterized networks specified by vertex-replacement graph grammars. In: Lahlou, S., Mukund, M. (eds.) NETYS 2025. LNCS, vol. 15736, pp. 57\u201380. Springer, Cham (2025)","DOI":"10.1007\/978-3-032-00347-8_4"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Jayaraman, K., et al.: Validating datacenters at scale. In: Proceedings of the ACM Special Interest Group on Data Communication, SIGCOMM \u201919, New York, NY, USA, pp. 200\u2013213. Association for Computing Machinery (2019)","DOI":"10.1145\/3341302.3342094"},{"issue":"7","key":"13_CR19","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1109\/32.708567","volume":"24","author":"D Le Metayer","year":"1998","unstructured":"Le Metayer, D.: Describing software architecture styles using graph grammars. IEEE Trans. Software Eng. 24(7), 521\u2013533 (1998)","journal-title":"IEEE Trans. Software Eng."},{"key":"13_CR20","unstructured":"Minsky, M.: Computation, Finite and Infinite Machines. Prentice Hall (1967)"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27879-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:06:49Z","timestamp":1780355209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27879-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032278784","9783032278791"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27879-1_13","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":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2026.informatik.uni-hamburg.de\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}