The limiting factor for quantitative analysis of Markov decision processes (MDP) against specifications given in linear temporal logic (LTL) is the size of the generated product. As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms. We present an extension of PRISM for LTL model checking of MDP using LDBA. While existing algorithms can be used only with minimal changes, the new approach takes advantage of the special structure and the smaller size of the obtained LDBA to speed up the model checking. We demonstrate the speed up experimentally by a comparison with other approaches.
CITATION STYLE
Sickert, S., & Křetínský, J. (2016). MoChiBA: Probabilistic LTL model checking using limit-deterministic büchi automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9938 LNCS, pp. 130–137). Springer Verlag. https://doi.org/10.1007/978-3-319-46520-3_9
Mendeley helps you to discover research relevant for your work.