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...
Главные авторы: | Brázdil, T, Forejt, V, Kucera, A |
---|---|
Другие авторы: | Aceto, L |
Формат: | Journal article |
Язык: | English |
Опубликовано: |
Springer
2008
|
Схожие документы
-
Markov Decision Processes with Multiple Long-run Average Objectives
по: Brázdil, T, и др.
Опубликовано: (2011) -
Reachability in recursive Markov decision processes.
по: Brázdil, T, и др.
Опубликовано: (2008) -
Markov Decision Processes with Multiple Long-run Average Objectives
по: Tomáš Brázdil, и др.
Опубликовано: (2014-02-01) -
Trading Performance for Stability in Markov Decision Processes
по: Brázdil, T, и др.
Опубликовано: (2013) -
Trading performance for stability in Markov decision processes
по: Brazdil, T, и др.
Опубликовано: (2016)