{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:56:39Z","timestamp":1753358199442,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899626"},{"type":"electronic","value":"9783319899633"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89963-3_21","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T14:53:00Z","timestamp":1523631180000},"page":"361-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Permutation Games for the Weakly Aconjunctive $$\\mu $$ \u03bc -Calculus"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Hausmann","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Hans-Peter","family":"Deifel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.4204\/EPTCS.161.12","volume":"161","author":"Florian Bruse","year":"2014","unstructured":"Bruse, F., Falk, M., Lange, M.: The fixpoint-iteration algorithm for parity games. In: Games, Automata, Logics and Formal Verification, GandALF 2014, EPTCS, vol. 161, pp. 116\u2013130 (2014)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-04027-6_15","volume-title":"Computer Science Logic","author":"C C\u00eerstea","year":"2009","unstructured":"C\u00eerstea, C., Kupke, C., Pattinson, D.: EXPTIME tableaux for the coalgebraic \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 179\u2013193. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04027-6_15"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM 42(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-87531-4_26","volume-title":"Computer Science Logic","author":"A Dawar","year":"2008","unstructured":"Dawar, A., Gr\u00e4del, E.: The descriptive complexity of parity games. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 354\u2013368. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-87531-4_26"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539793304741","volume":"29","author":"EA Emerson","year":"1999","unstructured":"Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. SIAM J. Comput. 29(1), 132\u2013158 (1999)","journal-title":"SIAM J. Comput."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-662-54577-5_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Esparza","year":"2017","unstructured":"Esparza, J., K\u0159et\u00ednsk\u00fd, J., Raskin, J.-F., Sickert, S.: From LTL and limit-deterministic B\u00fcchi automata to deterministic parity automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 426\u2013442. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54577-5_25"},{"key":"21_CR7","unstructured":"Fisman, D., Lustig, Y.: A modular approach for B\u00fcchi determinization. In: Concurrency Theory, CONCUR 2015, LIPIcs, vol. 42, pp. 368\u2013382. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"21_CR8","unstructured":"Friedmann, O., Lange, M.: The PGSolver collection of parity game solvers. Technical report, LMU Munich (2009)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.entcs.2010.04.008","volume":"262","author":"Oliver Friedmann","year":"2010","unstructured":"Friedmann, O., Lange, M.: A solver for modal fixpoint logics. In: Methods for Modalities, M4M-6 2009, ENTCS, vol. 262, pp. 99\u2013111 (2010)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1080\/11663081.2013.861181","volume":"23","author":"O Friedmann","year":"2013","unstructured":"Friedmann, O., Lange, M.: Deciding the unguarded modal \n                      \n                        \n                      \n                      $$\\rm \\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. J. Appl. Non-Classical Log. 23, 353\u2013371 (2013)","journal-title":"J. Appl. Non-Classical Log."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-319-08587-6_31","volume-title":"Automated Reasoning","author":"D Gor\u00edn","year":"2014","unstructured":"Gor\u00edn, D., Pattinson, D., Schr\u00f6der, L., Widmann, F., Wi\u00dfmann, T.: Cool \u2013 a generic reasoner for coalgebraic hybrid logics (system description). In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 396\u2013402. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08587-6_31"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Hausmann, D., Schr\u00f6der, L., Deifel, H.-P.: Permutation games for the weakly aconjunctive \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus (artifact). Figshare (2018). \n                      https:\/\/doi.org\/10.6084\/m9.figshare.5919451.v1","DOI":"10.6084\/m9.figshare.5919451.v1"},{"key":"21_CR13","unstructured":"Hausmann, D., Schr\u00f6der, L., Egger, C.: Global caching for the alternation-free coalgebraic \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. In: Concurrency Theory, CONCUR 2016, LIPIcs, vol. 59, pp. 34:1\u201334:15 (2016). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-45315-6_18","volume-title":"Foundations of Software Science and Computation Structures","author":"V King","year":"2001","unstructured":"King, V., Kupferman, O., Vardi, M.Y.: On the complexity of parity word automata. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 276\u2013286. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-45315-6_18"},{"key":"21_CR15","doi-asserted-by":"publisher","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 \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. Theor. Comput. Sci. 27, 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00370554","volume":"47","author":"D Kozen","year":"1988","unstructured":"Kozen, D.: A finite model theorem for the propositional \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. Stud. Log. 47, 233\u2013241 (1988)","journal-title":"Stud. Log."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1016\/j.ipl.2009.04.022","volume":"109","author":"W Liu","year":"2009","unstructured":"Liu, W., Wang, J.: A tighter analysis of Piterman\u2019s B\u00fcchi determinization. Inf. Process. Lett. 109, 941\u2013945 (2009)","journal-title":"Inf. Process. Lett."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D Niwinski","year":"1996","unstructured":"Niwinski, D., Walukiewicz, I.: Games for the \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. Theor. Comput. Sci. 163, 99\u2013116 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Log. Methods Comput. Sci. 3 (2007)","DOI":"10.2168\/LMCS-3(3:5)2007"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of omega-automata. In: Foundations of Computer Science, FOCS 1988, pp. 319\u2013327. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-00596-1_13","volume-title":"Foundations of Software Science and Computational Structures","author":"S Schewe","year":"2009","unstructured":"Schewe, S.: Tighter bounds for the determinisation of B\u00fcchi automata. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 167\u2013181. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-00596-1_13"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-662-44522-8_41","volume-title":"Mathematical Foundations of Computer Science 2014","author":"S Schewe","year":"2014","unstructured":"Schewe, S., Varghese, T.: Determinising parity automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 486\u2013498. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-44522-8_41"},{"key":"21_CR23","unstructured":"Tian, C., Duan, Z.: B\u00fcchi determinization made tighter. CoRR, abs\/1404.1436 (2014)"},{"key":"21_CR24","doi-asserted-by":"publisher","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 \n                      \n                        \n                      \n                      $$\\mu $$\n                      \n                        \n                          \u03bc\n                        \n                      \n                    -calculus. Inf. Comput. 157, 142\u2013182 (2000)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89963-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T03:17:29Z","timestamp":1583205449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89963-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899626","9783319899633"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89963-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"14 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/index.php\/2018\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}