Analyzing probabilistic pushdown automata

The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses.

[1]  Javier Esparza,et al.  Quantitative analysis of probabilistic pushdown automata: expectations and variances , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[2]  Kousha Etessami,et al.  Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars , 2012, ArXiv.

[3]  Tomás Brázdil,et al.  Branching-time model-checking of probabilistic pushdown automata , 2014, J. Comput. Syst. Sci..

[4]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

[7]  Laura Bozzelli,et al.  Complexity results on branching-time pushdown model checking , 2006, Theor. Comput. Sci..

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

[9]  Patricia Bouyer,et al.  Proceedings of TACAS 2004 , 2004 .

[10]  Michael Luttenberger,et al.  On the convergence of Newton's method for monotone systems of polynomial equations , 2007, STOC '07.

[11]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[12]  Kousha Etessami,et al.  Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems , 2008, QEST.

[13]  Tomás Brázdil,et al.  Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems , 2004, CONCUR.

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

[15]  Richard Mayr.  Strict Lower Bounds for Model Checking BPA , 1998, Electron. Notes Theor. Comput. Sci..

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

[17]  J. Rosenthal.  A First Look at Rigorous Probability Theory , 2000 .

[18]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[19]  Mikko Alava,et al.  Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.

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

[21]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[22]  Kousha Etessami,et al.  One-counter Markov decision processes , 2009, SODA '10.

[23]  Kousha Etessami,et al.  One-Counter Stochastic Games , 2010, FSTTCS.

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

[27]  Kousha Etessami,et al.  Algorithmic Verification of Recursive Probabilistic State Machines , 2005, TACAS.

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

[29]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[30]  Kousha Etessami,et al.  Checking LTL properties of recursive Markov chains , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[31]  Kai Lai Chung,et al.  Markov Chains with Stationary Transition Probabilities , 1961 .

[32]  Kousha Etessami,et al.  Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars , 2012, STOC '12.

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

[34]  Peter Bro Miltersen,et al.  On the complexity of numerical analysis , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

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

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

[37]  Tomás Brázdil,et al.  Runtime Analysis of Probabilistic Programs with Unbounded Recursion , 2010, ICALP.

[38]  J. Esparza,et al.  Model checking probabilistic pushdown automata , 2004, LICS 2004.

[39]  Igor Walukiewicz.  Model Checking CTL Properties of Pushdown Systems , 2000, FSTTCS.

[40]  Javier Esparza,et al.  Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[41]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

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

[43]  Tomás Brázdil,et al.  Discounted Properties of Probabilistic Pushdown Automata , 2008, LPAR.

[44]  Tomás Brázdil,et al.  Efficient Analysis of Probabilistic Programs with an Unbounded Counter , 2011, CAV.

[45]  Tomás Brázdil,et al.  Reachability in recursive Markov decision processes , 2008, Inf. Comput..

[46]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[47]  Javier Esparza,et al.  Computing Least Fixed Points of Probabilistic Systems of Polynomials , 2010, STACS.

[48]  Kousha Etessami,et al.  Approximating the termination value of one-counter MDPs and stochastic games , 2013, Inf. Comput..