---
_id: '2295'
abstract:
- lang: eng
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.
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
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:10.4230/LIPIcs.CSL.2013.165
apa: 'Chatterjee, K., Chmelik, M., & 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. https://doi.org/10.4230/LIPIcs.CSL.2013.165'
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. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
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.
ista: Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially
observable Markov decision processes with omega-regular objectives. 23, 165–180.
mla: Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable
Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.
short: K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 2013-09-02
date_created: 2018-12-11T11:56:50Z
date_published: 2013-08-27T00:00:00Z
date_updated: 2023-02-23T12:24:38Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2013.165
ec_funded: 1
file:
- access_level: open_access
checksum: ba2828322955574d9283bea0e17a37a6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:42Z
date_updated: 2020-07-14T12:45:37Z
file_id: '4766'
file_name: IST-2017-756-v1+1_2.pdf
file_size: 345171
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 165 - 180
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4633'
pubrep_id: '756'
quality_controlled: '1'
related_material:
record:
- id: '1477'
relation: later_version
status: public
- id: '5400'
relation: earlier_version
status: public
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: What is decidable about partially observable Markov decision processes with
omega-regular objectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...