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

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 Buchi 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.

[1]  Alexandre Duret-Lutz,et al.  LTL translation improvements in Spot 1.0 , 2014, Int. J. Crit. Comput. Based Syst..

[2]  Dimitra Giannakopoulou,et al.  From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata , 2002, FORTE.

[3]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4]  Nir Piterman.  From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata , 2007, Log. Methods Comput. Sci..

[5]  Marta Z. Kwiatkowska,et al.  The PRISM Benchmark Suite , 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

[6]  Christel Baier,et al.  Principles of model checking , 2008 .

[7]  Jan Strejcek,et al.  Comparison of LTL to Deterministic Rabin Automata Translators , 2013, LPAR.

[8]  Yih-Kuen Tsay,et al.  GOAL for Games, Omega-Automata, and Logics , 2013, CAV.

[9]  Carsten Fritz,et al.  Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata , 2003, CIAA.

[10]  Jan Kretínský,et al.  Deterministic Automata for the (F,G)-fragment of LTL , 2012, CAV.

[11]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 1984, PODC '84.

[12]  Jan Kretínský,et al.  From LTL to Deterministic Automata: A Safraless Compositional Approach , 2014, CAV.

[13]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[14]  Krishnendu Chatterjee,et al.  Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis , 2013, CAV.

[15]  Christel Baier,et al.  Are Good-for-Games Automata Good for Probabilistic Model Checking? , 2014, LATA.

[16]  Lijun Zhang,et al.  Lazy Probabilistic Model Checking without Determinisation , 2013, CONCUR.

[17]  Vojtech Rehák,et al.  LTL to Büchi Automata Translation: Fast and More Deterministic , 2012, TACAS.

[18]  Alexandre Duret-Lutz.  Manipulating LTL Formulas Using Spot 1.0 , 2013, ATVA.

[19]  Sven Schewe,et al.  Tighter Bounds for the Determinisation of Büchi Automata , 2009, FoSSaCS.

[20]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[21]  Jan Kretínský,et al.  Rabinizer: Small Deterministic Automata for LTL(F, G) , 2012, ATVA.

[22]  Thomas A. Henzinger,et al.  Solving Games Without Determinization , 2006, CSL.

[23]  Sven Schewe,et al.  Complementing Semi-deterministic Büchi Automata , 2016, TACAS.

[24]  Jan Kretínský,et al.  Rabinizer 2: Small Deterministic Automata for LTL ∖ GU , 2013, ATVA.

[25]  Jan Kretínský,et al.  Limit-Deterministic Büchi Automata for Linear Temporal Logic , 2016, CAV.

[26]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[27]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[28]  Fausto Giunchiglia,et al.  Improved Automata Generation for Linear Temporal Logic , 1999, CAV.

[29]  Grégoire Sutre,et al.  An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems , 2003, LPAR.

[30]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[31]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[32]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[33]  Jan Kretínský,et al.  Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata , 2014, ATVA.

[34]  Mahesh Viswanathan,et al.  Limit Deterministic and Probabilistic Automata for LTL ∖ GU , 2015, TACAS.

[35]  Jan Strejcek,et al.  Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment , 2013, ATVA.

[36]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.