{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:40Z","timestamp":1725798640086},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_1","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:12:23Z","timestamp":1407823943000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Partial-Observation Stochastic Reachability and Parity Games"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-78499-9_21","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Baier","year":"2008","unstructured":"Baier, C., Bertrand, N., Gr\u00f6\u00dfer, M.: On decision problems for probabilistic B\u00fcchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: LICS, pp. 319\u2013328. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.31"},{"key":"1_CR3","unstructured":"Chatterjee, K.: Stochastic \u03c9-Regular Games. PhD thesis, UC Berkeley (2007)"},{"key":"1_CR4","unstructured":"Chatterjee, K., Chmelik, M., Tracol, M.: What is decidable about partially observable Markov decision processes with omega-regular objectives. In: Proceedings of CSL 2013: Computer Science Logic (2013)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-15297-9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: The complexity of partial-observation parity games. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 1\u201314. Springer, Heidelberg (2010)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L.: Partial-observation stochastic games: How to win when belief fails. In: Proceedings of LICS 2012: Logic in Computer Science, pp. 175\u2013184. IEEE Computer Society Press (2012)","DOI":"10.1109\/LICS.2012.28"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-662-43951-7_10","volume-title":"Automata, Languages, and Programming","author":"K. Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L.: Games with a weak adversary. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol.\u00a08573, pp. 110\u2013121. Springer, Heidelberg (2014)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-642-15155-2_23","volume-title":"Mathematical Foundations of Computer Science 2010","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Gimbert, H., Henzinger, T.A.: Randomness for free. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 246\u2013257. Springer, Heidelberg (2010)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-15155-2_24","volume-title":"Mathematical Foundations of Computer Science 2010","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Qualitative analysis of partially-observable Markov decision processes. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 258\u2013269. Springer, Heidelberg (2010)"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10703-012-0164-2","volume":"43","author":"K. Chatterjee","year":"2013","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: A survey of partial-observation stochastic parity games. Formal Methods in System Design\u00a043(2), 268\u2013284 (2013)","journal-title":"Formal Methods in System Design"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science, 3(3:4) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-642-54830-7_16","volume-title":"Foundations of Software Science and Computation Structures","author":"K. Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L., Nain, S., Vardi, M.Y.: The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol.\u00a08412, pp. 242\u2013257. Springer, Heidelberg (2014)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"1_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.: Quantitative stochastic parity games. In: SODA 2004, pp. 121\u2013130. SIAM (2004)","DOI":"10.21236\/ADA603293"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Tracol, M.: Decidable problems for probabilistic automata on infinite words. In: LICS, pp. 185\u2013194 (2012)","DOI":"10.1109\/LICS.2012.29"},{"issue":"2","key":"1_CR16","first-page":"203","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. I&C\u00a096(2), 203\u2013224 (1992)","journal-title":"I&C"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Nain, S., Vardi, M.Y.: Solving partial-information stochastic parity games. In: LICS, pp. 341\u2013348 (2013)","DOI":"10.1109\/LICS.2013.40"},{"key":"1_CR18","unstructured":"Paz, A.: Introduction to probabilistic automata (Computer science and applied mathematics). Academic Press (1971)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:41:48Z","timestamp":1558953708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}