{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:08Z","timestamp":1760202608729,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_24","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"258-269","source":"Crossref","is-referenced-by-count":19,"title":["Qualitative Analysis of Partially-Observable Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Doyen","sequence":"additional","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_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":"24_CR2","first-page":"319","volume-title":"Proc. of LICS","author":"N. Bertrand","year":"2009","unstructured":"Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: Proc. of LICS, pp. 319\u2013328. IEEE Computer Society, Los Alamitos (2009)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-85361-9_27","volume-title":"CONCUR 2008 - Concurrency Theory","author":"D. Berwanger","year":"2008","unstructured":"Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T.A., Raje, S.: Strategy construction for parity games with imperfect information. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 325\u2013339. Springer, Heidelberg (2008)"},{"key":"24_CR4","unstructured":"Berwanger, D., Doyen, L.: On the power of imperfect information. In: Proc. of FSTTCS. Dagstuhl Seminar Proceedings 08004 (2008)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-04081-8_16","volume-title":"CONCUR 2009","author":"R. Chadha","year":"2009","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 229\u2013243. Springer, Heidelberg (2009)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Gimbert, H., Henzinger, T.A.: Randomness for free. In: Proc. of MFCS (2010)","DOI":"10.1007\/978-3-642-15155-2_23"},{"key":"24_CR8","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\u00a03(3:4) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Qualitative analysis of Partially-observable Markov decision processes. CoRR, abs\/0909.1645 (2009)","DOI":"10.1007\/978-3-642-15155-2_24"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: Proc. of SODA, pp. 114\u2013123 (2004)","DOI":"10.21236\/ADA603293"},{"key":"24_CR11","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University. Technical Report STAN-CS-TR-98-1601 (1997)"},{"key":"24_CR12","unstructured":"de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: Proc. of ProbMiV: Probabilistic Methods in Verification (1999)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11730637_14","volume-title":"Hybrid Systems: Computation and Control","author":"M. De Wulf","year":"2006","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: A lattice theory for solving games of imperfect information. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol.\u00a03927, pp. 153\u2013168. Springer, Heidelberg (2006)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-02930-1_17","volume-title":"Automata, Languages and Programming","author":"V. Gripon","year":"2009","unstructured":"Gripon, V., Serre, O.: Qualitative concurrent stochastic games with imperfect information. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 200\u2013211. Springer, Heidelberg (2009)"},{"key":"24_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A. Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)"},{"key":"24_CR16","unstructured":"Littman, M.L.: Algorithms for sequential decision making. PhD thesis, Brown University (1996)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell.\u00a0147(1-2) (2003)","DOI":"10.1016\/S0004-3702(02)00378-8"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"C.H. Papadimitriou","year":"1987","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of Markov decision processes. Mathematics of Operations Research\u00a012, 441\u2013450 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"24_CR19","volume-title":"Introduction to probabilistic automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to probabilistic automata. Academic Press, London (1971)"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J. Reif","year":"1984","unstructured":"Reif, J.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences\u00a029, 274\u2013301 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR21","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT. Technical Report MIT\/LCS\/TR-676 (1995)"},{"key":"24_CR22","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages, Beyond Words, ch. 7","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, Beyond Words, ch. 7, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"24_CR23","first-page":"327","volume-title":"Proc. of FOCS","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state systems. In: Proc. of FOCS, pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T12:32:15Z","timestamp":1740400335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}