{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:44Z","timestamp":1725542924783},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_25","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"375-389","source":"Crossref","is-referenced-by-count":4,"title":["Strategy Improvement for Stochastic Rabin and Streett Games"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/3-540-36494-3_58","volume-title":"STACS 2003","author":"H. Bjorklund","year":"2003","unstructured":"Bjorklund, H., Sandberg, S., Vorobyov, S.: A discrete subexponential algorithms for parity games. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 663\u2013674. Springer, Heidelberg (2003)"},{"key":"25_CR2","first-page":"206","volume-title":"QEST","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Trading memory for randomness. In: QEST, pp. 206\u2013217. IEEE Computer Society, Los Alamitos (2004)"},{"key":"25_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":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/11672142_42","volume-title":"STACS 2006","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A.: Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 512\u2013523. Springer, Heidelberg (2006)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-45220-1_11","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2003","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Simple Stochastic Parity Games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 100\u2013113. Springer, Heidelberg (2003)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Information and Computation\u00a096, 203\u2013224 (1992)","journal-title":"Information and Computation"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Condon, A.: On algorithms for simple stochastic games. In: Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a013, pp. 51\u201373. AMS (1993)","DOI":"10.1090\/dimacs\/013\/04"},{"key":"25_CR8","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)"},{"key":"25_CR9","first-page":"141","volume-title":"LICS","author":"L. Alfaro de","year":"2000","unstructured":"de Alfaro, L., Henzinger, T.A.: Concurrent \u03c9-regular games. In: LICS, pp. 141\u2013154. IEEE Computer Society, Los Alamitos (2000)"},{"key":"25_CR10","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, Los Alamitos (1988)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"A. Hoffman","year":"1966","unstructured":"Hoffman, A., Karp, R.: On nonterminating stochastic games. Management Science\u00a012, 359\u2013370 (1966)","journal-title":"Management Science"},{"key":"25_CR12","first-page":"224","volume-title":"STOC","author":"O. Kupferman","year":"1998","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree-automata emptiness. In: STOC, pp. 224\u2013233. ACM Press, New York (1998)"},{"key":"25_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)"},{"key":"25_CR14","volume-title":"LICS","author":"N. Piterman","year":"2006","unstructured":"Piterman, N., Pnueli, A.: Faster solutions of Rabin and Streett games. In: LICS, IEEE Computer Society, Los Alamitos (to appear, 2006)"},{"key":"25_CR15","first-page":"179","volume-title":"POPL","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM, New York (1989)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P.J. Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM J. Control and Optimization\u00a025, 206\u2013230 (1987)","journal-title":"SIAM J. Control and Optimization"},{"key":"25_CR17","series-title":"Handbook of Formal Languages","first-page":"389","volume-title":"Beyond Words","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Beyond Words. Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:29:54Z","timestamp":1619508594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11817949_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}