{"file_date_updated":"2020-07-14T12:45:37Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"page":"165 - 180","status":"public","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:56:50Z","month":"08","citation":{"ista":"Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">https://doi.org/10.4230/LIPIcs.CSL.2013.165</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">https://doi.org/10.4230/LIPIcs.CSL.2013.165</a>","short":"K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.","ama":"Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">10.4230/LIPIcs.CSL.2013.165</a>","mla":"Chatterjee, Krishnendu, et al. <i>What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">10.4230/LIPIcs.CSL.2013.165</a>.","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013."},"department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, we establish decidability (with optimal EXPTIME-complete complexity) of the qualitative analysis problems for POMDPs with all parity objectives under finite-memory strategies. We also establish asymptotically optimal (exponential) memory bounds.","lang":"eng"}],"publication_status":"published","alternative_title":["LIPIcs"],"related_material":{"record":[{"relation":"later_version","id":"1477","status":"public"},{"id":"5400","status":"public","relation":"earlier_version"}]},"conference":{"location":"Torino, Italy","name":"CSL: Computer Science Logic","end_date":"2013-09-05","start_date":"2013-09-02"},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"first_name":"Mathieu","full_name":"Tracol, Mathieu","last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.4230/LIPIcs.CSL.2013.165","_id":"2295","type":"conference","has_accepted_license":"1","volume":23,"date_updated":"2023-02-23T12:24:38Z","license":"https://creativecommons.org/licenses/by/4.0/","date_published":"2013-08-27T00:00:00Z","day":"27","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2013","oa_version":"Published Version","title":"What is decidable about partially observable Markov decision processes with omega-regular objectives","scopus_import":1,"series_title":"Leibniz International Proceedings in Informatics","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"        23","pubrep_id":"756","file":[{"creator":"system","file_id":"4766","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:09:42Z","checksum":"ba2828322955574d9283bea0e17a37a6","access_level":"open_access","relation":"main_file","file_name":"IST-2017-756-v1+1_2.pdf","file_size":345171,"content_type":"application/pdf"}],"publist_id":"4633"}