Publication details

MoChiBA: Probabilistic {LTL} Model Checking Using Limit-Deterministic Büchi Automata

Authors

SICKERT Salomon KŘETÍNSKÝ Jan

Year of publication 2016
Type Article in Proceedings
Conference Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-319-46520-3_9
Field Informatics
Keywords probabilistic model checking; verification; automata; temporal logic
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info