{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:44:09Z","timestamp":1794347049997,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540713883","type":"print"},{"value":"9783540713890","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71389-0_12","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T16:22:53Z","timestamp":1183306973000},"page":"153-167","source":"Crossref","is-referenced-by-count":32,"title":["Generalized Parity Games"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/10721959_20","volume-title":"Automated Deduction - CADE-17","author":"D. Bustan","year":"2000","unstructured":"Bustan, D., Grumberg, O.: Simulation based minimization. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 255\u2013270. Springer, Heidelberg (2000)"},{"key":"12_CR2","first-page":"160","volume-title":"LICS","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. In: LICS, pp. 160\u2013169. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"12_CR3","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Generalized parity games. Technical Report: UC Berkeley EECS-2006-144 (2006)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-55179-4_25","volume-title":"Computer Aided Verification","author":"D.L. Dill","year":"1992","unstructured":"Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simulation relations. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 255\u2013265. Springer, Heidelberg (1992)"},{"key":"12_CR5","first-page":"99","volume-title":"LICS","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games. In: LICS, pp. 99\u2013110. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"12_CR6","first-page":"328","volume-title":"FOCS","author":"E.A. Emerson","year":"1988","unstructured":"Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: FOCS, pp. 328\u2013337. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"12_CR7","first-page":"368","volume-title":"FOCS","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.: Tree automata, \u03bc-calculus and determinacy. In: FOCS, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-44618-4_13","volume-title":"CONCUR 2000 - Concurrency Theory","author":"K. Etessami","year":"2000","unstructured":"Etessami, K., Holzmann, G.: Optimizing B\u00fcchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 153\u2013167. Springer, Heidelberg (2000)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-63141-0_19","volume-title":"CONCUR\u201997: Concurrency Theory","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Kupferman, O., Rajamani, S.: Fair simulation. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 273\u2013287. Springer, Heidelberg (1997)"},{"key":"12_CR10","unstructured":"Horn, F.: Streett games on finite graphs. In: Games in Design and Verification (2005)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1109557.1109571","volume-title":"SODA","author":"M. Jurdzi\u0144ski","year":"2006","unstructured":"Jurdzi\u0144ski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: SODA, pp. 117\u2013123. ACM, New York (2006)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"65","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Annals of Mathematics\u00a065, 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"12_CR14","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: Second International Joint Conference on Artificial Intelligence, pp. 481\u2013489. The British Computer Society (1971)"},{"key":"12_CR15","first-page":"255","volume-title":"LICS","author":"N. Piterman","year":"2006","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: LICS, pp. 255\u2013264. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"12_CR16","first-page":"275","volume-title":"LICS","author":"N. Piterman","year":"2006","unstructured":"Piterman, N., Pnueli, A.: Faster solution of rabin and streett games. In: LICS, pp. 275\u2013284. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Transaction of the AMS\u00a0141, 1\u201335 (1969)","journal-title":"Transaction of the AMS"},{"key":"12_CR18","first-page":"81","volume":"77","author":"P.J.G. Ramadge","year":"1989","unstructured":"Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. IEEE Transactions on Control Theory\u00a077, 81\u201398 (1989)","journal-title":"IEEE Transactions on Control Theory"},{"key":"12_CR19","first-page":"319","volume-title":"FOCS","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: FOCS, pp. 319\u2013327. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/10722167_21","volume-title":"Computer Aided Verification","author":"F. Somenzi","year":"2000","unstructured":"Somenzi, F., Bloem, R.: Efficient B\u00fcchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 248\u2013263. Springer, Heidelberg (2000)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R.S. Streett","year":"1982","unstructured":"Streett, R.S.: Propositional dynamic logic of looping and converse. Information and Control\u00a054, 121\u2013141 (1982)","journal-title":"Information and Control"},{"issue":"1\u20132","key":"12_CR22","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. Theoretical Computer Science\u00a0200(1\u20132), 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:47:40Z","timestamp":1619502460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713883","9783540713890"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0","asserted-by":"object"}]},"subject":[]}}