Abstract
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses.
Similar content being viewed by others
Notes
The “BPA” acronym stands for Basic Process Algebra and is used mainly for historical reasons.
For every t∈S, we fix a fresh variable Y t . If t∈T, we put Y t =1. If t cannot reach T at all, we put Y t =0. Otherwise, we put \(Y_{t} = \sum_{t {}\mathchoice {\stackrel {x}{\rightarrow }} {\mathop {\smash \rightarrow }\limits ^{\vrule width 0pt height 0pt depth 4pt\smash {x}}} {\stackrel {x}{\rightarrow }} {\stackrel {x}{\rightarrow }} {} t'} x \cdot Y_{t'}\). The resulting system of linear equations has only one solution in ℝ|S| which is the tuple of all .
An instance of Square-Root-Sum is a tuple of positive integers a 1,…,a n ,b, and the question is whether \(\sum_{i=1}^{n} \sqrt{a_{i}} \leq b\). The problem is obviously in PSPACE, because it can be encoded in the existential fragment of Tarski algebra (see Sect. 2.2), and the best upper bound currently known is CH (counting hierarchy; see Corollary 1.4 in [1]). It is not known whether this bound can be further lowered to some natural Boolean subclass of PSPACE, and a progress in answering this question might lead to breakthrough results in complexity theory.
Here “almost every” is meant in the usual probabilistic sense, i.e., the probability of the remaining runs is zero.
The last configuration of a jump does not contribute to the total accumulated reward.
Formally, the “head” of a given pOC configuration p(k) is either (p,0) or (p,1), depending on whether k=0 or k>0, respectively. The input alphabet of the corresponding DRA is then Q×{0,1}.
References
Allender E, Bürgisser P, Kjeldgaard-Pedersen J, Miltersen P (2008) On the complexity of numerical analysis. SIAM J Comput 38:1987–2006
Alur R, Chaudhuri S, Etessami K, Madhusudan P (2005) On-the-fly reachability and cycle detection for recursive state machines. In: Proceedings of TACAS 2005. Lecture notes in computer science, vol 3440. Springer, Berlin, pp 61–76
Alur R, Etessami K, Yannakakis M (2001) Analysis of recursive state machines. In: Proceedings of CAV 2001. Lecture notes in computer science, vol 2102. Springer, Berlin, pp 207–220
Athreya K, Ney P (1972) Branching processes. Springer, Berlin
Baier C, Katoen JP (2008) Principles of model checking. MIT Press, Cambridge
Bouajjani A, Esparza J, Maler O (1997) Reachability analysis of pushdown automata: application to model checking. In: Proceedings of CONCUR’97. Lecture notes in computer science, vol 1243. Springer, Berlin, pp 135–150
Bozzelli L (2006) Complexity results on branching-time pushdown model checking. In: Proceedings of VMCAI 2006. Lecture notes in computer science, vol 3855. Springer, Berlin, pp 65–79
Brázdil T, Brožek V, Holeček J, Kučera A (2008) Discounted properties of probabilistic pushdown automata. In: Proceedings of LPAR 2008. Lecture notes in computer science, vol 5330. Springer, Berlin, pp 230–242
Brázdil T, Brožek V, Etessami K (2010) One-counter stochastic games. In: Proceedings of FST&TCS 2010. Leibniz international proceedings in informatics, vol 8. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp 108–119
Brázdil T, Brožek V, Etessami K, Kučera A (2011) Approximating the termination value of one-counter MDPs and stochastic games. In: Proceedings of ICALP 2011, Part II. Lecture notes in computer science, vol 6756. Springer, Berlin, pp 332–343
Brázdil T, Brožek V, Etessami K, Kučera A, Wojtczak D (2010) One-counter Markov decision processes. In: Proceedings of SODA 2010. SIAM, Philadelphia, pp 863–874
Brázdil T, Brožek V, Forejt V (2009) Branching-time model-checking of probabilistic pushdown automata. Electron Notes Theor Comput Sci 239:73–83
Brázdil T, Brožek V, Forejt V, Kučera A (2008) Reachability in recursive Markov decision processes. Inf Comput 206(5):520–537
Brázdil T, Esparza J, Kučera A (2005) Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion. In: Proceedings of FOCS 2005. IEEE Computer Society, Los Alamitos, pp 521–530
Brázdil T, Kiefer S, Kučera A (2011) Efficient analysis of probabilistic programs with an unbounded counter. In: Proceedings of CAV 2011. Lecture notes in computer science, vol 6806. Springer, Berlin, pp 208–224
Brázdil T, Kiefer S, Kučera A, Hutařová Vařeková I (2010) Runtime analysis of probabilistic programs with unbounded recursion. CoRR abs/1007.1710
Brázdil T, Kiefer S, Kučera A, Hutařová Vařeková I (2011) Runtime analysis of probabilistic programs with unbounded recursion. In: Proceedings of ICALP 2011, Part II. Lecture notes in computer science, vol 6756. Springer, Berlin, pp 319–331
Brázdil T, Kučera A, Stražovský O (2004) Deciding probabilistic bisimilarity over infinite-state probabilistic systems. In: Proceedings of CONCUR 2004. Lecture notes in computer science, vol 3170. Springer, Berlin, pp 193–208
Brázdil T, Kučera A, Stražovský O (2005) On the decidability of temporal properties of probabilistic pushdown automata. In: Proceedings of STACS 2005. Lecture notes in computer science, vol 3404. Springer, Berlin, pp 145–157
Canny J (1988) Some algebraic and geometric computations in PSPACE. In: Proceedings of STOC’88. ACM Press, New York, pp 460–467
Chung K (1967) Markov chains with stationary transition probabilities. Springer, Berlin
Emerson E (1991) Temporal and modal logic. In: Handbook of theoretical computer science B, pp 995–1072
Esparza J, Gaiser A, Kiefer S (2010) Computing least fixed points of probabilistic systems of polynomials. In: Proceedings of STACS 2010. Leibniz international proceedings in informatics, vol 5. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp 359–370
Esparza J, Hansel D, Rossmanith P, Schwoon S (2000) Efficient algorithms for model checking pushdown systems. In: Proceedings of CAV 2000. Lecture notes in computer science, vol 1855. Springer, Berlin, pp 232–247
Esparza J, Kučera A, Mayr R (2004) Model-checking probabilistic pushdown automata. In: Proceedings of LICS 2004. IEEE Computer Society, Los Alamitos, pp 12–21
Esparza J, Kučera A, Mayr R (2005) Quantitative analysis of probabilistic pushdown automata: Expectations and variances. In: Proceedings of LICS 2005. IEEE Computer Society, Los Alamitos, pp 117–126
Etessami K, Stewart A, Yannakakis M (2012) Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars. In: Proceedings of STOC 2012. ACM Press, New York, pp 579–588
Etessami K, Wojtczak D, Yannakakis M (2008) Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems. In: Proceedings of 5th Int. Conf. on Quantitative Evaluation of Systems (QEST’08). IEEE Computer Society, Los Alamitos
Etessami K, Yannakakis M (2005) Algorithmic verification of recursive probabilistic systems. In: Proceedings of TACAS 2005. Lecture notes in computer science, vol 3440. Springer, Berlin, pp 253–270
Etessami K, Yannakakis M (2005) Checking LTL properties of recursive Markov chains. In: Proceedings of 2nd int conf on quantitative evaluation of systems (QEST’05). IEEE Computer Society, Los Alamitos, pp 155–165
Etessami K, Yannakakis M (2005) Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. In: Proceedings of STACS 2005. Lecture notes in computer science, vol 3404. Springer, Berlin, pp 340–352
Etessami K, Yannakakis M (2009) Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J Assoc Comput Mach 56:1–66
Grigoriev D (1988) Complexity of deciding Tarski algebra. J Symb Comput 5(1–2):65–108
Hansson H, Jonsson B (1994) A logic for reasoning about time and reliability. Form Asp Comput 6:512–535
Harris T (1963) The theory of branching processes. Springer, Berlin
Hopcroft J, Ullman J (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading
Kiefer S, Luttenberger M, Esparza J (2007) On the convergence of Newton’s method for monotone systems of polynomial equations. In: Proceedings of STOC 2007. ACM Press, New York, pp 217–226
Mayr R (1998) Strict lower bounds for model checking BPA. In: Electronic notes in theoretical computer science, vol 18
Rosenthal J (2006) A first look at rigorous probability theory. World Scientific, Singapore
Tarski A (1951) A decision method for elementary algebra and geometry. Univ. of California Press, Berkeley
Tarski A (1955) A lattice-theoretical fixpoint theorem and its applications. Pac J Math 5(2):285–309
Walukiewicz I (2000) Model checking CTL properties of pushdown systems. In: Proceedings of FST&TCS’2000. Lecture notes in computer science, vol 1974. Springer, Berlin, pp 127–138
Williams D (1991) Probability with Martingales. Cambridge University Press, Cambridge
Acknowledgements
T. Brázdil and A. Kučera are supported by the Czech Science Foundation, grant No. P202/12/G061. S. Kiefer is supported by a postdoctoral fellowship of the German Academic Exchange Service (DAAD).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Brázdil, T., Esparza, J., Kiefer, S. et al. Analyzing probabilistic pushdown automata. Form Methods Syst Des 43, 124–163 (2013). https://doi.org/10.1007/s10703-012-0166-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10703-012-0166-0