{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:10Z","timestamp":1776316990690,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319735788","type":"print"},{"value":"9783319735795","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73579-5_8","type":"book-chapter","created":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T02:32:44Z","timestamp":1514860364000},"page":"115-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parity Games and Automata for Game Logic"],"prefix":"10.1007","author":[{"given":"Helle Hvid","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Marti","sequence":"additional","affiliation":[]},{"given":"Yde","family":"Venema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1027358927272","volume":"75","author":"D Berwanger","year":"2003","unstructured":"Berwanger, D.: Game logic is strong enough for parity games. Stud. Logica 75(2), 205\u2013219 (2003)","journal-title":"Stud. Logica"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bradfield, J., Stirling, C.: Modal $$\\mu $$ \u03bc -calculi. In: Handbook of Modal Logic, pp. 721\u2013756. Elsevier (2006)","DOI":"10.1016\/S1570-2464(07)80015-2"},{"key":"8_CR3","unstructured":"Carreiro, F., Venema, Y.: PDL inside the $$\\mu $$ \u03bc -calculus: a syntactic and an automata-theoretic characterization. In: Gor\u00e9, R., Kooi, B., Kurucz, A. (eds.) Advances in Modal Logic, vol. 10, pp. 74\u201393. College Publications (2014)"},{"key":"8_CR4","unstructured":"Carreiro, F.: Fragments of fixpoint logics. Ph.D. thesis, University of Amsterdam (2015)"},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic: An Introduction","author":"BF Chellas","year":"1980","unstructured":"Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"310","DOI":"10.2307\/2586539","volume":"65","author":"G d\u2019Agostino","year":"2000","unstructured":"d\u2019Agostino, G., Hollenberg, M.: Logical questions concerning the $$\\mu $$ \u03bc -calculus. J. Symbol. Logic 65, 310\u2013332 (2000)","journal-title":"J. Symbol. Logic"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: Proceedings of the 29th Symposium on the Foundations of Computer Science, pp. 328\u2013337. IEEE Computer Society Press (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"EA Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, P.: On model checking for the $$\\mu $$ \u03bc -calculus and its fragments. Theor. Comput. Sci. 258, 491\u2013522 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS 1991), pp. 368\u2013377. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"8_CR10","unstructured":"Enqvist, S., Seifan, F., Venema, Y.: Completeness for $$\\mu $$ \u03bc -calculi: a coalgebraic approach. Technical rep. PP-2017-04, ILLC, Universiteit van Amsterdam (2017)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-14162-1_32","volume-title":"Automata, Languages and Programming","author":"G Fontaine","year":"2010","unstructured":"Fontaine, G., Leal, R., Venema, Y.: Automata for coalgebras: an approach using predicate liftings. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 381\u2013392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_32"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"8_CR13","unstructured":"Hansen, H.H.: Monotonic modal logic. Master\u2019s thesis, University of Amsterdam (2003). iLLC Preprint PP-2003-24"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, H.H., Kupke, C.: Weak completeness of coalgebraic dynamic logics. In: Fixed Points in Computer Science (FICS). EPTCS, vol. 191, pp. 90\u2013104 (2015)","DOI":"10.4204\/EPTCS.191.9"},{"key":"8_CR15","unstructured":"Hansen, H., Kupke, C., Marti, J., Venema, Y.: Parity games and automata for game logic (extended version) (2017). http:\/\/www.arxiv.org"},{"key":"8_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press, Cambridge (2000)"},{"key":"8_CR17","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal $$\\mu $$ \u03bc -calculus and related results. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552\u2013562. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60246-1_160"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-36387-4_9","volume-title":"Automata Logics, and Infinite Games","author":"D Kirsten","year":"2002","unstructured":"Kirsten, D.: Alternating tree automata and parity games. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 153\u2013167. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_9"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$ \u03bc -calculus. Theoret. Comput. Sci. 27, 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"8_CR21","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.jlamp.2016.03.004","volume":"85","author":"A Madeira","year":"2016","unstructured":"Madeira, A., Neves, R., Martins, M.: An exercise on the generation of many-valued dynamic logics. J. Logic Algebraic Method Program. 85(5), 1011\u20131037 (2016)","journal-title":"J. Logic Algebraic Method Program."},{"key":"8_CR22","unstructured":"Mostowski, A.: Games with forbidden positions. Technical rep. 78, Instytut Matematyki, Uniwersytet Gda\u0144ski, Poland (1991)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Parikh, R.: The logic of games and its applications. In: Topics in the Theory of Computation. Annals of Discrete Mathematics, vol. 14. Elsevier (1985)","DOI":"10.1016\/S0304-0208(08)73078-0"},{"key":"8_CR24","unstructured":"Pauly, M.: Logic for social software. Ph.D. thesis, University of Amsterdam (2001)"},{"issue":"2","key":"8_CR25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1027354826364","volume":"75","author":"M Pauly","year":"2003","unstructured":"Pauly, M., Parikh, R.: Game logic: an overview. Stud. Logica 75(2), 165\u2013182 (2003)","journal-title":"Stud. Logica"},{"key":"8_CR26","unstructured":"Venema, Y.: Lectures on the modal $$\\mu $$ \u03bc -calculus (2012). https:\/\/staff.science.uva.nl\/y.venema\/"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Walukiewicz, I.: On completeness of the mu-calculus. In: Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS 1993), pp. 136\u2013146. IEEE Computer Society (1993)","DOI":"10.1109\/LICS.1993.287593"},{"issue":"1\u20132","key":"8_CR28","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional $$\\mu $$ \u03bc -calculus. Inf. Comput. 157(1\u20132), 142\u2013182 (2000). LICS 1995. San Diego, CA","journal-title":"Inf. Comput."},{"key":"8_CR29","doi-asserted-by":"crossref","first-page":"359","DOI":"10.36045\/bbms\/1102714178","volume":"8","author":"T Wilke","year":"2001","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal $$\\mu $$ \u03bc -calculus. Bull. Belg. Math. Soc. 8, 359\u2013391 (2001)","journal-title":"Bull. Belg. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Dynamic Logic. New Trends and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73579-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,25]],"date-time":"2020-10-25T03:15:39Z","timestamp":1603595739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73579-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319735788","9783319735795"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73579-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}