Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis

The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements.

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

[2]  Klaus Schneider,et al.  From LTL to Symbolically Represented Deterministic Automata , 2008, VMCAI.

[3]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

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

[5]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Roderick Bloem,et al.  Optimizations for LTL Synthesis , 2006, 2006 Formal Methods in Computer Aided Design.

[7]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[8]  Amir Pnueli,et al.  Synthesis of Reactive(1) designs , 2006, J. Comput. Syst. Sci..

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

[10]  C. Baier,et al.  Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic , 2005 .

[11]  Orna Kupferman,et al.  Recent Challenges and Ideas in Temporal Synthesis , 2012, SOFSEM.

[12]  Alonzo Church,et al.  Logic, arithmetic, and automata , 1962 .

[13]  Rüdiger Ehlers,et al.  Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis , 2011, NASA Formal Methods.

[14]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[15]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

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

[17]  Christel Baier,et al.  On-the-Fly Stuttering in the Construction of Deterministic ω-Automata , 2007 .

[18]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[19]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[20]  U. Rieder,et al.  Markov Decision Processes , 2010 .

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

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

[23]  Rajeev Alur,et al.  Deterministic generators and games for Ltl fragments , 2004, TOCL.

[24]  Amir Pnueli,et al.  Faster Solutions of Rabin and Streett Games , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[25]  Roderick Bloem,et al.  Anzu: A Tool for Property Synthesis , 2007, CAV.

[26]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 2005, Distributed Computing.

[27]  Krishnendu Chatterjee,et al.  Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification , 2011, SODA '11.

[28]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

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