Model checking probabilistic pushdown automata

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then, we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for general PCTL and the subclass of stateless pPDA. Finally, we consider the class of properties definable by deterministic Buchi automata, and show that both qualitative and quantitative model checking for pPDA is decidable.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[5]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

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

[7]  Mihalis Yannakakis,et al.  Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[9]  D. Grigor'ev.  Complexity of deciding Tarski algebra , 1988 .

[10]  Adnan Aziz,et al.  It Usually Works: The Temporal Logic of Stochastic Systems , 1995, CAV.

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

[12]  Michael Huth,et al.  Quantitative analysis and model checking , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[13]  S. Purushothaman Iyer,et al.  Probabilistic Lossy Channel Systems , 1997, TAPSOFT.

[14]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[15]  Bernhard Steffen,et al.  Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes , 1997, ICALP.

[16]  Orna Kupferman,et al.  Freedom, weakness, and determinism: from linear-time to branching-time , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[17]  Mitsunori Ogihara,et al.  Properties of Probabilistic Pushdown Automata , 1994, Theor. Comput. Sci..

[18]  Christel Baier,et al.  Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach , 1999, ARTS.

[19]  Fernando Pereira,et al.  Relating Probabilistic Grammars and Automata , 1999, ACL.

[20]  J. Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[21]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[22]  Rajeev Alur,et al.  Analysis of Recursive State Machines , 2001, CAV.

[23]  Nathalie Bertrand,et al.  Model Checking Lossy Channels Systems Is Probably Decidable , 2003, FoSSaCS.

[24]  Javier Esparza,et al.  Model checking LTL with regular valuations for pushdown systems , 2001, Inf. Comput..

[25]  Parosh Aziz Abdulla,et al.  Verification of Probabilistic Systems with Faulty Communication , 2003, FoSSaCS.

[26]  Alexander Moshe Rabinovich,et al.  Quantitative Analysis of Probabilistic Lossy Channel Systems , 2003, ICALP.

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

[28]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[29]  Kousha Etessami,et al.  Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations , 2005, STACS.

[30]  Tomás Brázdil,et al.  On the Decidability of Temporal Properties of Probabilistic Pushdown Automata , 2005, STACS.

[31]  Parosh Aziz Abdulla,et al.  Simulating perfect channels with probabilistic lossy channels , 2005, Inf. Comput..

[32]  Parosh Aziz Abdulla,et al.  Verification of probabilistic systems with faulty communication , 2005, Inf. Comput..