{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:06:40Z","timestamp":1782313600165,"version":"3.54.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031946332","type":"print"},{"value":"9783031946349","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-94634-9_13","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T07:59:29Z","timestamp":1749283169000},"page":"265-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Places and\u00a0Safe Net Reduction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6422-2006","authenticated-orcid":false,"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4563-1378","authenticated-orcid":false,"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0826-9330","authenticated-orcid":false,"given":"Alex","family":"Yakovlev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"issue":"1\u20132","key":"13_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(96)00219-8","volume":"186","author":"\u00c9 Badouel","year":"1997","unstructured":"Badouel, \u00c9., Bernardinello, L., Darondeau, P.: The synthesis problem for elementary net systems is NP-complete. Theor. Comput. Sci. 186(1\u20132), 107\u2013134 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Badouel, \u00c9., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47967-4","DOI":"10.1007\/978-3-662-47967-4"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-55610-9_167","volume-title":"Advances in Petri Nets 1992","author":"E Best","year":"1992","unstructured":"Best, E., Devillers, R., Hall, J.G.: The box calculus: a new causal algebra with multi-label communication. In: Rozenberg, G. (ed.) Advances in Petri Nets 1992. LNCS, vol. 609, pp. 21\u201369. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55610-9_167"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Best, E., Devillers, R.R., Koutny, M.: Petri net algebra. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04457-5","DOI":"10.1007\/978-3-662-04457-5"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0890-5401(02)93117-2","volume":"178","author":"E Best","year":"2002","unstructured":"Best, E., Devillers, R.R., Koutny, M.: The box algebra = Petri nets + process expressions. Inf. Comput. 178(1), 44\u2013100 (2002)","journal-title":"Inf. Comput."},{"issue":"5","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1109\/TCAD.2022.3206732","volume":"42","author":"A Chan","year":"2023","unstructured":"Chan, A., Sokolov, D., Khomenko, V., Lloyd, D., Yakovlev, A.: Burst automaton: framework for speed-independent synthesis using burst-mode specifications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(5), 1560\u20131573 (2023)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Logic Synthesis for Asynchronous Controllers and Interfaces. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-642-55989-1","DOI":"10.1007\/978-3-642-55989-1"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-52559-9_68","volume-title":"Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness","author":"R van Glabbeek","year":"1990","unstructured":"van Glabbeek, R., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 267\u2013300. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52559-9_68"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-13345-3_18","volume-title":"Automata, Languages and Programming","author":"U Goltz","year":"1984","unstructured":"Goltz, U., Mycroft, A.: On the relationship of CCS and petri nets. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 196\u2013208. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/3-540-13345-3_18"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. Exp. Algor. 13 (2009)","DOI":"10.1145\/1412228.1412236"},{"key":"13_CR11","volume-title":"Communicating Sequential Processes","author":"C Hoare","year":"1985","unstructured":"Hoare, C.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Avoiding exponential explosion in petri net models of control flows. In: Bernardinello, L., Petrucci, L. (eds.) Application and Theory of Petri Nets and Concurrency - 43rd International Conference, PETRI NETS 2022, Bergen, Norway, 19\u201324 June 2022, Proceedings. Lecture Notes in Computer Science, vol. 13288, pp. 261\u2013277. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06653-5_14","DOI":"10.1007\/978-3-031-06653-5_14"},{"key":"13_CR13","unstructured":"Khomenko, V., Koutny, M., Yakovlev, A.: Slimming down Petri boxes: compact Petri net models of control flows. In: Klin, B., Lasota, S., Muscholl, A. (eds.) 33rd International Conference on Concurrency Theory, CONCUR 2022, Warsaw, Poland, 12\u201316 September 2022. LIPIcs, vol.\u00a0243, pp. 8:1\u20138:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Meyer, R., H\u00fcchting, R.: A polynomial translation of pi-calculus FCPs to safe Petri nets. Logical Methods Comput. Sci. 9(3) (2013)","DOI":"10.2168\/LMCS-9(3:18)2013"},{"key":"13_CR15","unstructured":"Lerchs, H.: On cliques and kernels. Technical Report, Dept. of Comp. Sci., Univ. of Toronto (1971)"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3_11","DOI":"10.1007\/3-540-10235-3_11"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-18086-9_27","volume-title":"Advances in Petri Nets 1987","author":"E-R Olderog","year":"1987","unstructured":"Olderog, E.-R.: Operational Petri net semantics for CCSP. In: Rozenberg, G. (ed.) APN 1986. LNCS, vol. 266, pp. 196\u2013223. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18086-9_27"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BFb0055648","volume-title":"CONCUR\u201998 Concurrency Theory","author":"M Pietkiewicz-Koutny","year":"1998","unstructured":"Pietkiewicz-Koutny, M.: Synthesis of ENI-systems using minimal regions. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 565\u2013580. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055648"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A Valmari","year":"1998","unstructured":"Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 429\u2013528. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_21"}],"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-031-94634-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T08:03:47Z","timestamp":1749283427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94634-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031946332","9783031946349"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94634-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Paris","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf-2025.petrinet.net","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}