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...
| Κύριοι συγγραφείς: | , , |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Journal article |
| Γλώσσα: | English |
| Έκδοση: |
Springer
2008
|