{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:08:40Z","timestamp":1759334920178,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031975363"},{"type":"electronic","value":"9783031975370"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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-031-97537-0_11","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T22:47:21Z","timestamp":1759272441000},"page":"183-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finite-Memory Strategies for\u00a0Petri Games"],"prefix":"10.1007","author":[{"given":"Paul","family":"Hannibal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Lisiecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Becker, B., Podelski, A., Damm, W., Fr\u00e4nzle, M., Olderog, E.R., Wilhelm, R.: SFB\/TR 14 AVACS \u2013 automatic verification and analysis of complex systems (Der Sonderforschungsbereich\/Transregio 14 AVACS \u2013 Automatische Verifikation und Analyse komplexer Systeme). Inf. Technol. 49(2), 118\u2013126 (2007). https:\/\/doi.org\/10.1524\/itit.2007.49.2.118","DOI":"10.1524\/itit.2007.49.2.118"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Beutner, R., Finkbeiner, B., Hecking-Harbusch, J.: Translating asynchronous games for distributed synthesis. In: Fokkink, W.J., van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory, CONCUR 2019. LIPIcs, vol.\u00a0140, pp. 26:1\u201326:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.26","DOI":"10.4230\/LIPIcs.CONCUR.2019.26"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-06410-9_13","volume-title":"FM 2014: Formal Methods","author":"W Damm","year":"2014","unstructured":"Damm, W., Finkbeiner, B.: Automatic compositional synthesis of distributed systems. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 179\u2013193. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_13"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Inf. 28(6), 575\u2013591 (1991). https:\/\/doi.org\/10.1007\/BF01463946","journal-title":"Acta Inf."},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J Esparza","year":"1994","unstructured":"Esparza, J.: Model checking using net unfoldings. Sci. Comput. Program. 23(2), 151\u2013195 (1994). https:\/\/doi.org\/10.1016\/0167-6423(94)00019-0","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of Mcmillan\u2019s unfolding algorithm. Formal Methods Syst. Des. 20(3), 285\u2013310 (2002). https:\/\/doi.org\/10.1023\/A:1014746130920","journal-title":"Formal Methods Syst. Des."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-23506-6_15","volume-title":"Correct System Design","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B.: Bounded synthesis for Petri games. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 223\u2013237. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23506-6_15"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.R.: Global winning conditions in synthesis of distributed systems with causal memory. In: Manea, F., Simpson, A. (eds.) 30th EACSL Annual Conference on Computer Science Logic, CSL 2022. LIPIcs, vol.\u00a0216, pp. 20:1\u201320:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2022.20","DOI":"10.4230\/LIPIcs.CSL.2022.20"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-21690-4_25","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B., Gieseking, M., Olderog, E.R.: Adam: causality-based synthesis of distributed systems. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) Computer Aided Verification, pp. 433\u2013439. Springer, Cham (2015)"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., G\u00f6lz, P.: Synthesis in distributed environments. In: Lokam, S., Ramanujam, R. (eds.) 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). LIPIcs, vol.\u00a093, pp. 28:1\u201328:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2017.28","DOI":"10.4230\/LIPIcs.FSTTCS.2017.28"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.ic.2016.07.006","volume":"253","author":"B Finkbeiner","year":"2017","unstructured":"Finkbeiner, B., Olderog, E.R.: Petri games: synthesis of distributed systems with causal memory. Inf. Comput. 253, 181\u2013203 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.07.006","journal-title":"Inf. Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), Proceedings, pp. 321\u2013330. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/LICS.2005.53","DOI":"10.1109\/LICS.2005.53"},{"key":"11_CR13","unstructured":"Gieseking, M.: Correctness of data flows in asynchronous distributed systems: model checking and synthesis. Ph.D. thesis, University of Oldenburg, Germany (2022). http:\/\/oops.uni-oldenburg.de\/5688"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-72013-1_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Gieseking","year":"2021","unstructured":"Gieseking, M., Hecking-Harbusch, J., Yanich, A.: A web interface for petri nets with transits and Petri games. In: TACAS 2021. LNCS, vol. 12652, pp. 381\u2013388. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_22"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Gimbert, H.: On the control of asynchronous automata. In: Lokam, S.V., Ramanujam, R. (eds.) 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). LIPIcs, vol.\u00a093, pp. 30:1\u201330:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2017.30","DOI":"10.4230\/LIPIcs.FSTTCS.2017.30"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Gimbert, H.: Distributed asynchronous games with causal memory are undecidable. Log. Methods Comput. Sci. 18(3) (2022). https:\/\/doi.org\/10.46298\/lmcs-18(3:30)2022","DOI":"10.46298\/lmcs-18(3:30)2022"},{"key":"11_CR17","unstructured":"Hecking-Harbusch, J.: Synthesis of asynchronous distributed systems from global specifications. Ph.D. thesis, Saarland University, Saarbr\u00fccken, Germany (2021). https:\/\/publikationen.sulb.uni-saarland.de\/handle\/20.500.11880\/32108"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: 31st Annual Symposium on Foundations of Computer Science, vol. 2, pp. 746\u2013757. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89597","DOI":"10.1109\/FSCS.1990.89597"},{"key":"11_CR19","unstructured":"Schewe, S.: Synthesis of distributed systems. Ph.D. thesis, Saarland University, Saarbr\u00fccken, Germany (2008). http:\/\/react.cs.uni-sb.de\/publications\/S08c.html"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes in finite asynchronous automata. RAIRO - Theor. Inform. Appl. - Informatique Th\u00e9orique et Applications 21(2), 99\u2013135 (1987)","journal-title":"RAIRO - Theor. Inform. Appl. - Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Engineering Safe and Trustworthy Cyber Physical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97537-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T22:47:23Z","timestamp":1759272443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97537-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031975363","9783031975370"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97537-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}