{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:48Z","timestamp":1725565908864},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_95","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"1150-1162","source":"Crossref","is-referenced-by-count":10,"title":["Games with Winning Conditions of High Borel Complexity"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Serre","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"95_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0304-3975(02)00442-5","volume":"303","author":"A. Arnold","year":"2003","unstructured":"Arnold, A., Vincent, A., Walukiewicz, I.: Games for synthesis of controlers with partial observation. Theoretical Computer Science\u00a0303(1), 7\u201334 (2003)","journal-title":"Theoretical Computer Science"},{"key":"95_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-24597-1_8","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouquet","year":"2003","unstructured":"Bouquet, A., Serre, O., Walukiewicz, I.: Pushdown games with the unboundedness and regular conditions. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 88\u201399. Springer, Heidelberg (2003)"},{"key":"95_CR3","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Uniform solution of parity games on prefix-recognizable graphs","author":"T. Cachat","year":"2002","unstructured":"Cachat, T.: Uniform solution of parity games on prefix-recognizable graphs. Electronic Notes in Theoretical Computer Science, vol.\u00a068. Elsevier, Amsterdam (2002)"},{"key":"95_CR4","series-title":"T. Cachat, J. Duparc, and W. Thomas","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-45793-3_22","volume-title":"Computer Science Logic","author":"T. Cachat","year":"2002","unstructured":"Cachat, T., Duparc, J., Thomas, W.: Solving pushdown games with a \u03a33 winning condition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. T. Cachat, J. Duparc, and W. Thomas, vol.\u00a02471, pp. 322\u2013336. Springer, Heidelberg (2002)"},{"issue":"1","key":"95_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2694911","volume":"66","author":"J. Duparc","year":"2001","unstructured":"Duparc, J.: Wadge hierarchy and Veblen hierarchy. part I: Borel sets of finite rank. Journal of Symbolic Logic\u00a066(1), 56\u201386 (2001)","journal-title":"Journal of Symbolic Logic"},{"issue":"1-2","key":"95_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for the mu-calculus and its fragments. Theoretical Computer Science\u00a0258(1-2), 491\u2013522 (2001)","journal-title":"Theoretical Computer Science"},{"key":"95_CR7","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":"95_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-45793-3_18","volume-title":"Computer Science Logic","author":"J. Marcinkowski","year":"2002","unstructured":"Marcinkowski, J., Truderung, T.: Optimal complexity bounds for positive LTL games. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 262\u2013275. Springer, Heidelberg (2002)"},{"key":"95_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Annals of Mathematics\u00a0102, 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"95_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0020-0190(02)00445-3","volume":"85","author":"O. Serre","year":"2003","unstructured":"Serre, O.: Note on winning positions on pushdown games with \u03c9-regular conditions. Information Processing Letters\u00a085, 285\u2013291 (2003)","journal-title":"Information Processing Letters"},{"key":"95_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"95_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification (extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"key":"95_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"J. V\u00f6ge","year":"2000","unstructured":"V\u00f6ge, J., Jurdzi\u0144ski, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 202\u2013215. Springer, Heidelberg (2000)"},{"key":"95_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Pushdown processes: games and model checking. Information and Computation\u00a0157, 234\u2013263 (2000)","journal-title":"Information and Computation"},{"issue":"1-2","key":"95_CR15","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-2), 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_95.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:31:12Z","timestamp":1619998272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}