{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:23:46Z","timestamp":1755998626568},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030308056"},{"type":"electronic","value":"9783030308063"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-30806-3_6","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:36Z","timestamp":1567760916000},"page":"63-78","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Partial Solvers for Generalized Parity Games"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]},{"given":"Cl\u00e9ment","family":"Tamines","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.226.1","volume":"226","author":"Patrick Ah-Fat","year":"2016","unstructured":"Ah-Fat, P., Huth, M.: Partial solvers for parity games: effective polynomial-time composition. In: GandALF Proceedings. EPTCS, vol. 226, pp. 1\u201315 (2016). \n                    https:\/\/doi.org\/10.4204\/EPTCS.226.1","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-14295-6_36","volume-title":"Computer Aided Verification","author":"R Bloem","year":"2010","unstructured":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T.A., Jobstmann, B.: Robustness in the presence of liveness. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 410\u2013424. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14295-6_36"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: STOC Proceedings, pp. 252\u2013263. ACM (2017). \n                    https:\/\/doi.org\/10.1145\/3055399.3055409","DOI":"10.1145\/3055399.3055409"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Dvor\u00e1k, W., Henzinger, M., Loitzenbauer, V.: Conditionally optimal algorithms for generalized B\u00fcchi games. In: MFCS Proceedings. LIPIcs, vol. 58, pp. 25:1\u201325:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.25","DOI":"10.4230\/LIPIcs.MFCS.2016.25"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2597631","volume":"61","author":"Krishnendu Chatterjee","year":"2014","unstructured":"Chatterjee, K., Henzinger, M.: Efficient and dynamic algorithms for alternating b\u00fcchi games and maximal end-component decomposition. J. ACM 61(3), 15:1\u201315:40 (2014). \n                    https:\/\/doi.org\/10.1145\/2597631","journal-title":"Journal of the ACM"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-71389-0_12","volume-title":"Foundations of Software Science and Computational Structures","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Generalized parity games. In: Seidl, H. (ed.) FoSSaCS 2007. LNCS, vol. 4423, pp. 153\u2013167. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-71389-0_12"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-89960-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Dijk","year":"2018","unstructured":"Dijk, T.: Oink: an implementation and evaluation of modern parity game solvers. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 291\u2013308. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-89960-2_16"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-12002-2_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Doyen","year":"2010","unstructured":"Doyen, L., Raskin, J.-F.: Antichain algorithms for finite automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 2\u201322. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-12002-2_2"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS Proceedings, pp. 368\u2013377. IEEE Computer Society (1991). \n                    https:\/\/doi.org\/10.1109\/SFCS.1991.185392","DOI":"10.1109\/SFCS.1991.185392"},{"issue":"5-6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10009-012-0222-5","volume":"15","author":"Emmanuel Filiot","year":"2012","unstructured":"Filiot, E., Jin, N., Raskin, J.: Exploiting structure in LTL synthesis. STTT 15(5-6), 541\u2013561 (2013). \n                    https:\/\/doi.org\/10.1007\/s10009-012-0222-5","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04761-9_15","volume-title":"Automated Technology for Verification and Analysis","author":"O Friedmann","year":"2009","unstructured":"Friedmann, O., Lange, M.: Solving parity games in practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 182\u2013196. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-04761-9_15"},{"key":"6_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). \n                    https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-37075-5_3","volume-title":"Foundations of Software Science and Computation Structures","author":"M Huth","year":"2013","unstructured":"Huth, M., Kuo, J.H.-P., Piterman, N.: Fatal attractors in parity games. In: Pfenning, F. (ed.) FoSSaCS 2013. LNCS, vol. 7794, pp. 34\u201349. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-37075-5_3"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-27810-0_8","volume-title":"Semantics, Logics, and Calculi","author":"M Huth","year":"2016","unstructured":"Huth, M., Kuo, J.H.-P., Piterman, N.: Static analysis of parity games: alternating reachability under parity. In: Probst, C.W., Hankin, C., Hansen, R.R. (eds.) Semantics, Logics, and Calculi. LNCS, vol. 9560, pp. 159\u2013177. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-27810-0_8"},{"key":"6_CR15","unstructured":"Jacobs, S., et al.: The 5th reactive synthesis competition (SYNTCOMP 2018): Benchmarks, participants & results. CoRR abs\/1904.07736 (2019). \n                    http:\/\/arxiv.org\/abs\/1904.07736"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in UP \n                    \n                      \n                    \n                    $$\\cap $$\n                    \n                      \n                        \u2229\n                      \n                    \n                   co-UP. Inf. Process. Lett. 68(3), 119\u2013124 (1998). \n                    https:\/\/doi.org\/10.1016\/S0020-0190(98)00150-1","journal-title":"Inf. Process. Lett."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"DA Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 102, 363\u2013371 (1975)","journal-title":"Ann. Math."},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL Proceedings, pp. 179\u2013190. ACM Press (1989). \n                    https:\/\/doi.org\/10.1145\/75277.75293","DOI":"10.1145\/75277.75293"},{"issue":"1\u20132","key":"6_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1\u20132), 135\u2013183 (1998). \n                    https:\/\/doi.org\/10.1016\/S0304-3975(98)00009-7","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:09:32Z","timestamp":1567760972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}