Abstract
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.
Funding source: Deutsche Forschungsgemeinschaft
Award Identifier / Grant number: DFG GRK 1765
Funding statement: This work was supported by the German Research Foundation (DFG) through the Research Training Group (DFG GRK 1765) SCARE.
About the author
Nick Würdemann studied Mathematics at the University of Oldenburg, where he earned his Master of Science in 2018. Directly after that, he joined the group “Correct System Design”, headed by Prof. Dr. Ernst-Rüdiger Olderog, as a PhD student at the University of Oldenburg.
References
1. Beutner, R., Finkbeiner, B., Hecking-Harbusch, J.: Translating asynchronous games for distributed synthesis. In: Proc. CONCUR 2019. pp. 26:1–26:16 (2019).Search in Google Scholar
2. 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. 373–396. Springer (1991).10.1007/978-3-642-84524-6_13Search in Google Scholar
3. Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A symbolic reachability graph for coloured Petri nets. Theor. Comput. Sci. 176(1-2), 39–65 (1997).10.1016/S0304-3975(96)00010-2Search in Google Scholar
4. Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. Summaries of the Summer Institute of Symbolic Logic 1, 3–50, Cornell Univ., Ithaca, NY (1957).Search in Google Scholar
5. Clarke, E.M., Emerson, E.A., Jha, S., Sistla, A.P.: Symmetry reductions in model checking. In: Proc. CAV 1998. pp. 147–158. LNCS1427 (1998).10.1007/BFb0028741Search in Google Scholar
6. Finkbeiner, B., Gieseking, M., Olderog, E.: Adam: Causality-based synthesis of distributed systems. In: Proc. CAV 2015, Part I. pp. 433–439. LNCS9206 (2015).10.1007/978-3-319-21690-4_25Search in Google Scholar
7. Finkbeiner, B., Olderog, E.: Petri games: Synthesis of distributed systems with causal memory. In: Proc. GandALF 2014. pp. 217–230. EPTCS161 (2014).10.4204/EPTCS.161.19Search in Google Scholar
8. Finkbeiner, B., Olderog, E.: Petri games: Synthesis of distributed systems with causal memory. Inf. Comput. 253, 181–203 (2017).10.1016/j.ic.2016.07.006Search in Google Scholar
9. Finkbeiner, B.: Bounded synthesis for petri games. In: Proc. Correct System Design – Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, 2015. pp. 223–237 (2015).10.1007/978-3-319-23506-6_15Search in Google Scholar
10. Finkbeiner, B., Gölz, P.: Synthesis in distributed environments. In: Proc. FSTTCS 2017. pp. 28:1–28:14 (2017).Search in Google Scholar
11. Gieseking, M., Olderog, E.: High-level representation of benchmark families for Petri games. CoRR abs/1904.05621 (2019).Search in Google Scholar
12. Gieseking, M., Olderog, E., Würdemann, N.: Solving high-level Petri games. Acta Inf. 57(3-5), 591–626 (2020).10.1007/s00236-020-00368-5Search in Google Scholar
13. 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. 381–388. LNCS12652 (2021).10.1007/978-3-030-72013-1_22Search in Google Scholar
14. Gieseking, M., Würdemann, 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.10.1007/978-3-030-76983-3_6Search in Google Scholar
15. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS2500. Springer (2002).10.1007/3-540-36387-4Search in Google Scholar
16. Jensen, K.: Coloured Petri Nets – Basic Concepts, Analysis Methods and Practical Use – Volume 1. EATCS Monographs on Theoretical Computer Science. Springer (1992).Search in Google Scholar
17. Khomenko, V., Koutny, M.: Branching processes of high-level petri nets. In: Proc. TACAS 2003. pp. 458–472. LNCS2619 (2003).10.1007/3-540-36577-X_34Search in Google Scholar
18. Kozura, V.E.: Unfoldings of coloured petri nets. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) Proc. PSI 2001. pp. 268–278. LNCS2244 (2001).10.1007/3-540-45575-2_27Search in Google Scholar
19. Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. LICS 2001. pp. 389–398 (2001).Search in Google Scholar
20. Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: Raman, V., Suresh, S.P. (eds.) Proc. FSTTCS 2014. pp. 639–651. LIPIcs29 (2014).Search in Google Scholar
21. Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. FOCS. pp. 746–757. IEEE Computer Society Press (1990).Search in Google Scholar
22. Reisig, W.: Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, vol. 4. Springer (1985).10.1007/978-3-642-69968-9Search in Google Scholar
23. Starke, P.H.: Reachability analysis of Petri nets using symmetries. Syst. Anal. Model. Simul. 8(4-5), 293–303 (1991).Search in Google Scholar
24. Tanenbaum, A.S., van Steen, M.: Distributed systems – principles and paradigms, 2nd Edition. Pearson Education (2007).Search in Google Scholar
25. Zielonka, W.: Asynchronous automata. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces. pp. 205–247. World Scientific (1995).10.1142/9789814261456_0007Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
