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)