{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:58Z","timestamp":1760202598717},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_6","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"64-78","source":"Crossref","is-referenced-by-count":4,"title":["Fair Adversaries and Randomization in Two-Player Games"],"prefix":"10.1007","author":[{"given":"Eugene","family":"Asarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl","family":"Chane-Yack-Fa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Varacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"217","volume-title":"LICS 2008","author":"C. Baier","year":"2008","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Gr\u00f6\u00dfer, M.: Almost-sure model checking of infinite paths in one-clock timed automata. In: LICS 2008, pp. 217\u2013226. IEEE Computer Society, Los Alamitos (2008)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004460050046","volume":"11","author":"C. Baier","year":"1998","unstructured":"Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing\u00a011(3), 125\u2013155 (1998)","journal-title":"Distributed Computing"},{"key":"6_CR3","first-page":"319","volume-title":"LICS 2009","author":"N. Bertrand","year":"2009","unstructured":"Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: LICS 2009, pp. 319\u2013328. IEEE Computer Society, Los Alamitos (2009)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","first-page":"226","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Berwanger","year":"2003","unstructured":"Berwanger, D., Gr\u00e4del, E., Kreutzer, S.: Once upon a time in the West. Determinacy, complexity and definability of path games. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 226\u2013240. Springer, Heidelberg (2003)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science\u00a03(3) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004, pp. 114\u2013123. ACM\/SIAM (2004)","DOI":"10.21236\/ADA603293"},{"issue":"4","key":"6_CR7","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. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"6_CR8","first-page":"368","volume-title":"FOCS 1991","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS 1991, pp. 368\u2013377. IEEE Computer Society, Los Alamitos (1991)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","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.\u00a02500. Springer, Heidelberg (2002)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume-title":"Logics of Programs","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 196\u2013218. Springer, Heidelberg (1985)"},{"volume-title":"The Scottish Book","year":"1981","key":"6_CR11","unstructured":"Mauldin, D. (ed.): The Scottish Book. Birkh\u00e4user, Basel (1981)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-642-04081-8_39","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M. Schmalz","year":"2009","unstructured":"Schmalz, M., Varacca, D., V\u00f6lzer, H.: Counterexamples in probabilistic LTL model checking for Markov chains. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol.\u00a05710, pp. 587\u2013602. Springer, Heidelberg (2009)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-540-77050-3_44","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"M. Schmalz","year":"2007","unstructured":"Schmalz, M., V\u00f6lzer, H., Varacca, D.: Model checking almost all paths can be less expensive than checking all paths. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 532\u2013543. Springer, Heidelberg (2007)"},{"key":"6_CR14","first-page":"389","volume-title":"LICS 2006","author":"D. Varacca","year":"2006","unstructured":"Varacca, D., V\u00f6lzer, H.: Temporal logics and model checking for fairly correct systems. In: LICS 2006, pp. 389\u2013398. IEEE Computer Society, Los Alamitos (2006)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11539452_35","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"H. V\u00f6lzer","year":"2005","unstructured":"V\u00f6lzer, H., Varacca, D., Kindler, E.: Defining fairness. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 458\u2013472. Springer, Heidelberg (2005)"},{"key":"6_CR16","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. Computer Science\u00a0200, 135\u2013183 (1998)","journal-title":"Theor. Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:04Z","timestamp":1606186024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}