Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives.
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 qualitat...
Huvudupphovsmän: | Brázdil, T, Forejt, V, Kucera, A |
---|---|
Övriga upphovsmän: | Aceto, L |
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
Springer
2008
|
Liknande verk
Liknande verk
-
Markov Decision Processes with Multiple Long-run Average Objectives
av: Brázdil, T, et al.
Publicerad: (2011) -
Reachability in recursive Markov decision processes.
av: Brázdil, T, et al.
Publicerad: (2008) -
Markov Decision Processes with Multiple Long-run Average Objectives
av: Tomáš Brázdil, et al.
Publicerad: (2014-02-01) -
Trading Performance for Stability in Markov Decision Processes
av: Brázdil, T, et al.
Publicerad: (2013) -
Trading performance for stability in Markov decision processes
av: Brazdil, T, et al.
Publicerad: (2016)