{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:48:50Z","timestamp":1753181330406},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_4","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"34-54","source":"Crossref","is-referenced-by-count":4,"title":["Stochastic Games with Finitary Objectives"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"52","volume-title":"LICS 1994","author":"R. Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: Finitary fairness. In: LICS 1994, pp. 52\u201361. IEEE, Los Alamitos (1994)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2007.07.047","volume":"388","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K.: Concurrent games with tail objectives. Theoretical Computer Science\u00a0388, 181\u2013198 (2007)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1007\/11523468_71","volume-title":"Automata, Languages and Programming","author":"K. Chatterjee","year":"2005","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of stochastic Rabin and Streett games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 878\u2013890. Springer, Heidelberg (2005)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11691372_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A.: Finitary winning in \u03c9-regular games. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 257\u2013271. Springer, Heidelberg (2006)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Horn, F.: Finitary winning in \u03c9-regular games. Technical Report: UCB\/EECS-2007-120 (2007)","DOI":"10.21236\/ADA637154"},{"key":"4_CR6","first-page":"121","volume-title":"SODA 2004","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004, pp. 121\u2013130. SIAM, Philadelphia (2004)"},{"key":"4_CR7","first-page":"141","volume-title":"LICS 2000","author":"L. Alfaro de","year":"2000","unstructured":"de Alfaro, L., Henzinger, T.A.: Concurrent omega-regular games. In: LICS 2000, pp. 141\u2013154. IEEE, Los Alamitos (2000)"},{"key":"4_CR8","first-page":"99","volume-title":"LICS 1997","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S., Jurdzinski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: LICS 1997, pp. 99\u2013110. IEEE, Los Alamitos (1997)"},{"key":"4_CR9","first-page":"328","volume-title":"FOCS 1988","author":"E.A. Emerson","year":"1988","unstructured":"Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: FOCS 1988, pp. 328\u2013337. IEEE, Los Alamitos (1988)"},{"key":"4_CR10","first-page":"60","volume-title":"STOC 1982","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC 1982, pp. 60\u201365. ACM Press, New York (1982)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2007.04.010","volume":"104","author":"F. Horn","year":"2007","unstructured":"Horn, F.: Dicing on the streett. IPL\u00a0104, 1\u20139 (2007)","journal-title":"IPL"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-71209-1_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Horn","year":"2007","unstructured":"Horn, F.: Faster algorithms for finitary games. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 472\u2013484. Springer, Heidelberg (2007)"},{"key":"4_CR13","unstructured":"Horn, F.: Random Games. PhD thesis, Universit\u00e9 Denis-Diderot and RWTH, Aachen (2008)"},{"issue":"2","key":"4_CR14","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(2), 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: The determinacy of Blackwell games. The Journal of Symbolic Logic\u00a063(4), 1565\u20131581 (1998)","journal-title":"The Journal of Symbolic Logic"},{"key":"4_CR16","first-page":"275","volume-title":"LICS 2006","author":"N. Piterman","year":"2006","unstructured":"Piterman, N., Pnueli, A.: Faster solution of Rabin and Streett games. In: LICS 2006, pp. 275\u2013284. IEEE, Los Alamitos (2006)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-540-24727-2_35","volume-title":"Foundations of Software Science and Computation Structures","author":"W. Zielonka","year":"2004","unstructured":"Zielonka, W.: Perfect-information stochastic parity games. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 499\u2013513. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:33:43Z","timestamp":1558478023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}