![]() doi: 10.1007/978-3-4_26ĭaniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. doi: 10.1007/9-2_16Ĭouvreur, J.-M., Saheb, N., Sutre, G.: An optimal automata approach to LTL model checking of probabilistic systems. ACM 42(4), 857–907 (1995)Ĭouvreur, J.-M.: On-the-fly verification of linear temporal logic. doi: 10.1007/978-9-8_37Ĭourcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. doi: 10.1007/978-1-5_12Ĭhatterjee, K., Gaiser, A., Křetínský, J.: Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. ![]() In: McMillan, K., Middeldorp, A., Voronkov, A. doi: 10.1007/978-4-9_49īlahoudek, F., Křetínský, M., Strejček, J.: Comparison of LTL to deterministic Rabin automata translators. MIT Press, Cambridge (2008)īlahoudek, F., Heizmann, M., Schewe, S., Strejček, J., Tsai, M.-H.: Complementing semi-deterministic Büchi automata. 24–39 (2013)īabiak, T., Křetínský, M., Řehák, V., Strejček, J.: LTL to Büchi automata translation: fast and more deterministic. This process is experimental and the keywords may be updated as the learning algorithm improves.īabiak, T., Blahoudek, F., Křetínský, M., Strejček, J.: Effective translation of LTL to deterministic Rabin automata: beyond the (F, G)-fragment. These keywords were added by machine and not by the authors. We demonstrate the speed up experimentally by a comparison with other approaches. 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 present an extension of PRISM for LTL model checking of MDP using LDBA. As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms. ![]() 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. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |