{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:50:19Z","timestamp":1747198219414,"version":"3.40.5"},"reference-count":25,"publisher":"Walter de Gruyter GmbH","issue":"5-6","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["DFG GRK 1765"],"award-info":[{"award-number":["DFG GRK 1765"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,25]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Distributed Synthesis is the problem of automatically generating correct controllers for individual agents in a distributed system. Petri games model this problem by a game between two teams of players on a Petri net structure. Under some restrictions, Petri games can be solved by a reduction to a two player game. The concept of symmetries in Petri nets is closely related to high-level representations of Petri games. Applying symmetries to the states in the two-player game results in a significant state space reduction. We give an overview about (high-level) Petri games and the application of symmetries in this setting. We present ongoing work aiming to concisely describe solutions of Petri games by a high-level representation.<\/jats:p>","DOI":"10.1515\/itit-2021-0012","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T20:27:48Z","timestamp":1631910468000},"page":"321-331","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting symmetries of high-level Petri games in distributed synthesis"],"prefix":"10.1515","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7934-820X","authenticated-orcid":false,"given":"Nick","family":"W\u00fcrdemann","sequence":"first","affiliation":[{"name":"11233 University of Oldenburg , Department of Computing Science , Oldenburg , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2021,9,18]]},"reference":[{"key":"2023033120083229036_j_itit-2021-0012_ref_001","unstructured":"Beutner, R., Finkbeiner, B., Hecking-Harbusch, J.: Translating asynchronous games for distributed synthesis. In: Proc. CONCUR 2019. pp.\u200926:1\u201326:16 (2019)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_002","doi-asserted-by":"crossref","unstructured":"Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed coloured nets and their symbolic reachability graph. In: Jensen, K., Rozenberg, G. (eds.) High-level Petri Nets: Theory and Application. pp.\u2009373\u2013396. Springer (1991).","DOI":"10.1007\/978-3-642-84524-6_13"},{"key":"2023033120083229036_j_itit-2021-0012_ref_003","doi-asserted-by":"crossref","unstructured":"Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A symbolic reachability graph for coloured Petri nets. Theor. Comput. Sci. 176(1-2), 39\u201365 (1997).","DOI":"10.1016\/S0304-3975(96)00010-2"},{"key":"2023033120083229036_j_itit-2021-0012_ref_004","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. Summaries of the Summer Institute of Symbolic Logic 1, 3\u201350, Cornell Univ., Ithaca, NY (1957)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_005","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A., Jha, S., Sistla, A.P.: Symmetry reductions in model checking. In: Proc. CAV 1998. pp.\u2009147\u2013158. LNCS1427 (1998).","DOI":"10.1007\/BFb0028741"},{"key":"2023033120083229036_j_itit-2021-0012_ref_006","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Gieseking, M., Olderog, E.: Adam: Causality-based synthesis of distributed systems. In: Proc. CAV 2015, Part I. pp.\u2009433\u2013439. LNCS9206 (2015).","DOI":"10.1007\/978-3-319-21690-4_25"},{"key":"2023033120083229036_j_itit-2021-0012_ref_007","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Olderog, E.: Petri games: Synthesis of distributed systems with causal memory. In: Proc. GandALF 2014. pp.\u2009217\u2013230. EPTCS161 (2014).","DOI":"10.4204\/EPTCS.161.19"},{"key":"2023033120083229036_j_itit-2021-0012_ref_008","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Olderog, E.: Petri games: Synthesis of distributed systems with causal memory. Inf. Comput. 253, 181\u2013203 (2017).","DOI":"10.1016\/j.ic.2016.07.006"},{"key":"2023033120083229036_j_itit-2021-0012_ref_009","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B.: Bounded synthesis for petri games. In: Proc. Correct System Design \u2013 Symposium in Honor of Ernst-R\u00fcdiger Olderog on the Occasion of His 60th Birthday, 2015. pp.\u2009223\u2013237 (2015).","DOI":"10.1007\/978-3-319-23506-6_15"},{"key":"2023033120083229036_j_itit-2021-0012_ref_010","unstructured":"Finkbeiner, B., G\u00f6lz, P.: Synthesis in distributed environments. In: Proc. FSTTCS 2017. pp.\u200928:1\u201328:14 (2017)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_011","unstructured":"Gieseking, M., Olderog, E.: High-level representation of benchmark families for Petri games. CoRR abs\/1904.05621 (2019)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_012","doi-asserted-by":"crossref","unstructured":"Gieseking, M., Olderog, E., W\u00fcrdemann, N.: Solving high-level Petri games. Acta Inf. 57(3-5), 591\u2013626 (2020).","DOI":"10.1007\/s00236-020-00368-5"},{"key":"2023033120083229036_j_itit-2021-0012_ref_013","doi-asserted-by":"crossref","unstructured":"Gieseking, M., Hecking-Harbusch, J., Yanich, A.: A web interface for petri nets with transits and petri games. In: Proc. TACAS 2021, Part II. pp.\u2009381\u2013388. LNCS12652 (2021).","DOI":"10.1007\/978-3-030-72013-1_22"},{"key":"2023033120083229036_j_itit-2021-0012_ref_014","doi-asserted-by":"crossref","unstructured":"Gieseking, M., W\u00fcrdemann, N.: Canonical Representations for Direct Generation of Strategies in High-Level Petri Games. In: Buchs, D., Carmona, J. (eds.) Proc. Petri Nets 2021. LNCS12734. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_6.","DOI":"10.1007\/978-3-030-76983-3_6"},{"key":"2023033120083229036_j_itit-2021-0012_ref_015","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS2500. Springer (2002).","DOI":"10.1007\/3-540-36387-4"},{"key":"2023033120083229036_j_itit-2021-0012_ref_016","unstructured":"Jensen, K.: Coloured Petri Nets \u2013 Basic Concepts, Analysis Methods and Practical Use \u2013 Volume 1. EATCS Monographs on Theoretical Computer Science. Springer (1992)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_017","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Koutny, M.: Branching processes of high-level petri nets. In: Proc. TACAS 2003. pp.\u2009458\u2013472. LNCS2619 (2003).","DOI":"10.1007\/3-540-36577-X_34"},{"key":"2023033120083229036_j_itit-2021-0012_ref_018","doi-asserted-by":"crossref","unstructured":"Kozura, V.E.: Unfoldings of coloured petri nets. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) Proc. PSI 2001. pp.\u2009268\u2013278. LNCS2244 (2001).","DOI":"10.1007\/3-540-45575-2_27"},{"key":"2023033120083229036_j_itit-2021-0012_ref_019","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. LICS 2001. pp.\u2009389\u2013398 (2001)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_020","unstructured":"Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: Raman, V., Suresh, S.P. (eds.) Proc. FSTTCS 2014. pp.\u2009639\u2013651. LIPIcs29 (2014)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_021","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. FOCS. pp.\u2009746\u2013757. IEEE Computer Society Press (1990).","DOI":"10.1109\/FSCS.1990.89597"},{"key":"2023033120083229036_j_itit-2021-0012_ref_022","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, vol.\u20094. Springer (1985).","DOI":"10.1007\/978-3-642-69968-9"},{"key":"2023033120083229036_j_itit-2021-0012_ref_023","unstructured":"Starke, P.H.: Reachability analysis of Petri nets using symmetries. Syst. Anal. Model. Simul. 8(4-5), 293\u2013303 (1991)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_024","unstructured":"Tanenbaum, A.S., van Steen, M.: Distributed systems \u2013 principles and paradigms, 2nd Edition. Pearson Education (2007)."},{"key":"2023033120083229036_j_itit-2021-0012_ref_025","doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Asynchronous automata. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces. pp.\u2009205\u2013247. World Scientific (1995).","DOI":"10.1142\/9789814261456_0007"}],"container-title":["it - Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2021-0012\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2021-0012\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:57:08Z","timestamp":1725807428000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2021-0012\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,18]]},"references-count":25,"journal-issue":{"issue":"5-6","published-online":{"date-parts":[[2021,9,18]]},"published-print":{"date-parts":[[2021,11,25]]}},"alternative-id":["10.1515\/itit-2021-0012"],"URL":"https:\/\/doi.org\/10.1515\/itit-2021-0012","relation":{},"ISSN":["2196-7032","1611-2776"],"issn-type":[{"type":"electronic","value":"2196-7032"},{"type":"print","value":"1611-2776"}],"subject":[],"published":{"date-parts":[[2021,9,18]]}}}