{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T15:12:22Z","timestamp":1784560342421,"version":"3.55.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031757778","type":"print"},{"value":"9783031757785","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"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-75778-5_19","type":"book-chapter","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T12:09:31Z","timestamp":1731845371000},"page":"399-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ten Years of\u00a0Petri Games"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Finkbeiner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-662-63079-2","volume":"15","author":"F Adobbati","year":"2021","unstructured":"Adobbati, F., Bernardinello, L., Pomello, L.: A two-player asynchronous game on fully observable Petri nets. Trans. Petri Nets Other Model. Concurr. 15, 126\u2013149 (2021). https:\/\/doi.org\/10.1007\/978-3-662-63079-2","journal-title":"Trans. Petri Nets Other Model. Concurr."},{"key":"19_CR2","unstructured":"Adobbati, F., Bernardinello, L., Pomello, L.: Solving a safety game on the unfolding of safe Petri nets. In: K\u00f6hler-Bussmeier, M., Moldt, D., R\u00f6lke, H. (eds.) Proc. of the 2023 Intern. Workshop on Petri Nets and Software Engineering (PNSE 2023). CEUR Workshop Proceedings, vol.\u00a03430, pp. 53\u201369. CEUR-WS.org (2023), https:\/\/ceur-ws.org\/Vol-3430\/paper4.pdf"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Best, E., Devillers, R.: Petri Net Primer \u2013 A Compendium of the Core Model, Analysis, and Synthesis. Computer Science Foundations and Applied Logic, Birkh\u00e4user (2024). https:\/\/doi.org\/10.1007\/978-3-031-48278-6","DOI":"10.1007\/978-3-031-48278-6"},{"key":"19_CR4","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 Intern. Conf. 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":"19_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, M.: An $$O(n^2)$$ time algorithm for alternating B\u00fcchi games. In: Proc. of the Twenty-third Annual ACM-SIAM Symp. on Discrete Algorithms. pp. 1386\u20131399. SODA \u201912, SIAM (2012). http:\/\/dl.acm.org\/citation.cfm?id=2095116.2095225","DOI":"10.1137\/1.9781611973099.109"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Eisentraut, C., Hermanns, H., Katoen, J., Zhang, L.: A semantics for every GSPN. In: Colom, J.M., Desel, J. (eds.) Application and Theory of Petri Nets and Concurrency \u2013 34th Intern. Conf., Proc. LNCS, vol.\u00a07927, pp. 90\u2013109. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38697-8","DOI":"10.1007\/978-3-642-38697-8"},{"issue":"6","key":"19_CR7","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 Informatica 28(6), 575\u2013591 (1991). https:\/\/doi.org\/10.1007\/BF01463946","journal-title":"Acta Informatica"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Esparza, J.: Model checking using net unfoldings. Science of Comp. Progr. 23, 151\u2013195 (1994). https:\/\/doi.org\/10.1016\/0167-6423(94)00019-0","DOI":"10.1016\/0167-6423(94)00019-0"},{"key":"19_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-77426-6","journal-title":"Springer"},{"key":"19_CR10","first-page":"244","volume":"52","author":"J Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bull. EATCS 52, 244\u2013262 (1994)","journal-title":"Bull. EATCS"},{"issue":"3","key":"19_CR11","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":"19_CR12","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":"19_CR13","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":"19_CR14","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.R.: Symbolic vs. bounded synthesis for Petri games. In: Dana\u00a0Fisman, S.J. (ed.) Proceedings Sixth Workshop on Synthesis, SYNT 2017. EPTCS, vol.\u00a0202, pp. 19\u201339 (2017). https:\/\/doi.org\/10.4204\/EPTCS.260.5","DOI":"10.4204\/EPTCS.260.5"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.R.: AdamMC: a model checker for Petri nets with transits against Flow-LTL. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification (CAV). LNCS, vol. 12225, pp. 64\u201376. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8","DOI":"10.1007\/978-3-030-53291-8"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Gieseking, M., Olderog, E.R.: Adam: ausality-based synthesis of distributed systems. In: Kroening, D., Pasareanu, C.S. (eds.) Computer Aided Verification (CAV). LNCS, vol.\u00a09206, pp. 433\u2013439. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4","DOI":"10.1007\/978-3-319-21690-4"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., G\u00f6lz, P.: Synthesis in distributed environments. In: Lokam, S.V., Ramanujam, R. (eds.) Foundations of Software Technology and Theoret. Comp. Sci. (FSTTCS). LIPIcs, vol.\u00a093, pp. 28:1\u201328:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2017.28","DOI":"10.4230\/LIPIcs.FSTTCS.2017.28"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Olderog, E.R.: Petri games: Synthesis of distributed systems with causal memory. In: Peron, A., Piazza, C. (eds.) Proc. Fifth Intern. Symp. on Games, Automata, Logics and Formal Verification (GandALF). EPTCS, vol.\u00a0161, pp. 217\u2013230 (2014). https:\/\/doi.org\/10.4204\/EPTCS.161.19","DOI":"10.4204\/EPTCS.161.19"},{"key":"19_CR19","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":"19_CR20","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":"19_CR21","doi-asserted-by":"publisher","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Asynchronous games over tree architectures. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M.Z., Peleg, D. (eds.) Automata, Languages, and Programming \u2013 40th Intern. Coll., ICALP 2013, Proc., Part II. LNCS, vol.\u00a07966, pp. 275\u2013286. Springer (2013).https:\/\/doi.org\/10.1007\/978-3-642-39212-2","DOI":"10.1007\/978-3-642-39212-2"},{"key":"19_CR22","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":"19_CR23","doi-asserted-by":"publisher","unstructured":"Gieseking, M., Hecking-Harbusch, J., Yanich, A.: A web interface for Petri nets with transits and Petri games. In: Groote, J.F., Larsen, K.G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems \u2013 27th Intern. Conf. (TACAS 2021), Proceedings, Part II. LNCS, vol. 12652, pp. 381\u2013388. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1","DOI":"10.1007\/978-3-030-72013-1"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Gieseking, M., Olderog, E.R.: High-level representation of benchmark families for Petri games. In: Olderog, E.R., Steffen, B., Yi, W. (eds.) Model Checking, Synthesis, and Learning. LNCS, vol. 13030, pp. 115\u2013137. Springer (2021).https:\/\/doi.org\/10.1007\/978-3-030-91384-7","DOI":"10.1007\/978-3-030-91384-7"},{"issue":"3\u20135","key":"19_CR25","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00236-020-00368-5","volume":"57","author":"M Gieseking","year":"2020","unstructured":"Gieseking, M., Olderog, E., W\u00fcrdemann, N.: Solving high-level Petri games. Acta Informatica 57(3\u20135), 591\u2013626 (2020). https:\/\/doi.org\/10.1007\/s00236-020-00368-5","journal-title":"Acta Informatica"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Gieseking, M., W\u00fcrdemann, N.: Canonical representations for direct generation of strategies in high-level Petri games. In: Buchs, D., Carmona, J. (eds.) Application and Theory of Petri Nets and Concurrency - 42nd Intern. Conf., Proc. LNCS, vol. 12734, pp. 95\u2013117. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3","DOI":"10.1007\/978-3-030-76983-3"},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Gimbert, H.: On the control of asynchronous automata. In: Lokam, S.V., Ramanujam, R. (eds.) 37th IARCS Annual Conf. 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":"19_CR28","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":"19_CR29","doi-asserted-by":"publisher","unstructured":"G\u00fcdemann, M., Ortmeier, F., Reif, W.: Formal modeling and verification of systems with self-x properties. In: Yang, L.T., Jin, H., Ma, J., Ungerer, T. (eds.) Autonomic and Trusted Computing, Third Intern. Conf., ATC 2006, Proc. LNCS, vol.\u00a04158, pp. 38\u201347. Springer (2006). https:\/\/doi.org\/10.1007\/11839569","DOI":"10.1007\/11839569"},{"key":"19_CR30","doi-asserted-by":"publisher","unstructured":"Hannibal, P.: (Un)decidability bounds of the synthesis problem for Petri games. In: Achilleos, A., Monica, D.D. (eds.) Proc. 14th Intern. Symp. on Games, Automata, Logics and Formal Verification (GandALF). EPTCS, vol.\u00a0390, pp. 115\u2013131 (2023). https:\/\/doi.org\/10.4204\/EPTCS.390.8","DOI":"10.4204\/EPTCS.390.8"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Hannibal, P., Olderog, E.R.: The synthesis problem for repeatedly communicating Petri games. In: Bernardinello, L., Petrucci, L. (eds.) Application and Theory of Petri Nets and Concurrency \u2013 43rd Intern. Conf., Proc. LNCS, vol. 13288, pp. 236\u2013257. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-06653-5","DOI":"10.1007\/978-3-031-06653-5"},{"key":"19_CR32","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":"19_CR33","doi-asserted-by":"publisher","unstructured":"Hecking-Harbusch, J., Tentrup, L.: Solving QBF by abstraction. In: Proc. Ninth Intern. Symp. on Games, Automata, Logics, and Formal Verification, GandALF 2018. pp. 88\u2013102 (2018). https:\/\/doi.org\/10.4204\/EPTCS.277.7","DOI":"10.4204\/EPTCS.277.7"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Volume 1. Springer (1992). http:\/\/dx.doi.org\/10.1007\/978-3-662-06289-0?nosfx=y","DOI":"10.1007\/978-3-662-06289-0"},{"key":"19_CR35","doi-asserted-by":"publisher","unstructured":"Junges, S., Katoen, J., Stoelinga, M., Volk, M.: One net fits all \u2013 a unifying semantics of dynamic fault trees using GSPNs. In: Khomenko, V., Roux, O.H. (eds.) Application and Theory of Petri Nets and Concurrency \u2013 39th Intern. Conf., Proc. LNCS, vol. 10877, pp. 272\u2013293. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4","DOI":"10.1007\/978-3-319-91268-4"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Katoen, J.: Causal behaviours and nets. In: Michelis, G.D., Diaz, M. (eds.) Application and Theory of Petri Nets 1995, 16th Intern. Conf., Proc. LNCS, vol.\u00a0935, pp. 258\u2013277. Springer (1995). https:\/\/doi.org\/10.1007\/3-540-60029-9","DOI":"10.1007\/3-540-60029-9"},{"key":"19_CR37","doi-asserted-by":"publisher","unstructured":"Langerak, R., Brinksma, E., Katoen, J.: Causal ambiguity and partial orders in event structures. In: Mazurkiewicz, A.W., Winkowski, J. (eds.) CONCUR \u201997: Concurrency Theory, 8th Intern. Conf., Proc. LNCS, vol.\u00a01243, pp. 317\u2013331. Springer (1997). https:\/\/doi.org\/10.1007\/3-540-63141-0","DOI":"10.1007\/3-540-63141-0"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Brim, L., Jancar, P., Kret\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002 \u2013 Concurrency Theory, 13th Intern. Conf., Proc. pp. 145\u2013160 (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5","DOI":"10.1007\/3-540-45694-5"},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Madhusudan, P., Thiagarajan, P.S., Yang, S.: The MSO theory of connectedly communicating processes. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th Intern. Conf., 2005, Proc. LNCS, vol.\u00a03821, pp. 201\u2013212. Springer (2005). https:\/\/doi.org\/10.1007\/11590156","DOI":"10.1007\/11590156"},{"issue":"3","key":"19_CR40","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"EW Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984). https:\/\/doi.org\/10.1137\/0213029","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR41","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"KL McMillan","year":"1995","unstructured":"McMillan, K.L.: A technique of state space search based on unfolding. Formal Methods Syst. Des. 6(1), 45\u201365 (1995). https:\/\/doi.org\/10.1007\/BF01384314","journal-title":"Formal Methods Syst. Des."},{"key":"19_CR42","doi-asserted-by":"publisher","unstructured":"Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: Raman, V., Suresh, S.P. (eds.) 34th Intern. Conf. on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014. LIPIcs, vol.\u00a029, pp. 639\u2013651. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2014.639","DOI":"10.4230\/LIPICS.FSTTCS.2014.639"},{"key":"19_CR43","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Univ. Bonn (1962). Schriften des Inst. f\u00fcr Instrumentelle Mathematik"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: 31st Annual Symp. on Foundations of Computer Science, 1990, Volume II, pp. 746\u2013757. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89597","DOI":"10.1109\/FSCS.1990.89597"},{"key":"19_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets - An Introduction. Springer (1985). https:\/\/doi.org\/10.1007\/978-3-642-69968-9","journal-title":"Petri Nets - An Introduction. Springer"},{"key":"19_CR46","doi-asserted-by":"publisher","unstructured":"Reisig, W., Rozenberg, G. (eds.): Carl Adam Petri: Ideas, Personality, Impact. Springer (2019).https:\/\/doi.org\/10.1007\/978-3-319-96154-5","DOI":"10.1007\/978-3-319-96154-5"},{"key":"19_CR47","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"},{"key":"19_CR48","doi-asserted-by":"publisher","unstructured":"Tentrup, L.: Non-prenex QBF solving using abstraction. In: Creignou, N., Berre, D.L. (eds.) Theory and Applications of Satisfiability Testing \u2013 SAT 2016, Proc. LNCS, vol.\u00a09710, pp. 393\u2013401. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2","DOI":"10.1007\/978-3-319-40970-2"},{"key":"19_CR49","unstructured":"W\u00fcrdemann, N.: Taking Synthesis of Distributed Systems via Petri Games to High Level, Symbolically. Ph.D. thesis, University of Oldenburg, Germany (2024). http:\/\/oops.uni-oldenburg.de\/6906"},{"issue":"2","key":"19_CR50","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 - Theoretical Informatics and Applications - Informatique Th\u00e9orique et Applications 21(2), 99\u2013135 (1987). https:\/\/doi.org\/10.1051\/ITA\/1987210200991","journal-title":"RAIRO - Theoretical Informatics and Applications - Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Principles of Verification: Cycling the Probabilistic Landscape"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75778-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T13:03:20Z","timestamp":1731848600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75778-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"ISBN":["9783031757778","9783031757785"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75778-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"18 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}