Quantitative analysis of probabilistic pushdown automata: expectations and variances

Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic programs with recursive procedure calls. Previous works considered the decidability and complexity of the model-checking problem for pPDA and various probabilistic temporal logics. In this paper we concentrate on computing the expected values and variances of various random variables defined over runs of a given probabilistic pushdown automaton. In particular, we show how to compute the expected accumulated reward and the expected gain for certain classes of reward functions. Using these results, we show how to analyze various quantitative properties of pPDA that are not expressible in conventional probabilistic temporal logics.

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

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

[3]  Dima Grigoriev,et al.  Complexity of Deciding Tarski Algebra , 1988, J. Symb. Comput..

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

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

[6]  Luca de Alfaro,et al.  How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems , 1998, LICS.

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

[8]  Michael Benedikt,et al.  Model Checking of Unrestricted Hierarchical State Machines , 2001, ICALP.

[9]  Javier Esparza,et al.  Model checking probabilistic pushdown automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[10]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[11]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

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

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

[14]  Rajeev Alur,et al.  Analysis of recursive state machines , 2001, TOPL.

[15]  Swarat Chaudhuri,et al.  On-the-Fly Reachability and Cycle Detection for Recursive State Machines , 2005, TACAS.