Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives

Investor logo

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš FOREJT Vojtěch KUČERA Antonín

Year of publication 2008
Type Article in Proceedings
Conference Automata, Languages and Programming. 35th International Colloquium, ICALP 2008. Reykjavik, Iceland, July 2008. Proceedings, Part II.
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords Markov decision processes; Probabilistic Temporal Logics
Description We show that the controller synthesis and verification problems for Markov decision processes with qualitative PECTL* objectives are 2-EXPTIME complete. More precisely, the algorithms are polynomial in the size of a given Markov decision process and doubly exponential in the size of a given qualitative PECTL* formula. Moreover, we show that if a given qualitative PECTL* objective is achievable by some strategy, then it is also achievable by an effectively constructible one-counter strategy, where the associated complexity bounds are essentially the same as above. For the fragment of qualitative PCTL objectives, we obtain EXPTIME completeness and the algorithms are only singly exponential in the size of the formula.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.