Algorithmic verification of recursive probabilistic state machines

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 253-270

  Etessami, Kousha ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

MODEL CHECKING; POLYNOMIAL TIMES; PROBABILISTIC PROGRAMS; RECURSIVE MARKOV CHAINS (RMC);

MARKOV PROCESSES;

EID: 24644481560     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_17     Document Type: Conference Paper

References (20)

1. [AEY01] R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of 13th Int. Conf. on Computer-Aided Verification, pages 304-313, 2001.
2. [BGR01] M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In Proc. of ICALP'01, volume 2076 of LNCS, pages 652-666, 2001.
3. [Bil95] P. Billingsley. Probability and Measure. J. Wiley and Sons, 3rd edition, 1995.
4. [BKS05] T. Brázdil, A. Kučera, and O. Straž ovský. Decidability of temporal properties of probabilistic pushdown automata. In Proc. of 22nd STACS'05. Springer, 2005.
5. [BPR96] S. Basu, R. Pollack, and M. F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. of the ACM, 43(6): 1002-1045, 1996.
6. [BR00] T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN'2000, volume 1885 of LNCS, pages 113-130, 2000.
7. [Can88] J. Canny. Some algebraic and geometric computations in PSPACE. In Prof, of 20th ACM STOC, pages 460-467, 1988.
8. [CY95] C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
9. [EE04] J. Esparza and K. Etessami. Verifying probabilistic procedural programs. In Proc. FSTTCS'04, 2004. (Invited survey paper).
10. [EHRS00] J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In 12th CAV, volume 1855, pages 232-247. Springer, 2000.
11. [EKM04] Javier Esparza, Antonin Kucera, and Richard Mayr. Model checking probabilistic pushdown automata. In Proc. of 19th IEEE LICS'04, 2004.
12. [EY05] K. Etessami and M. Yannakakis. Recursive markov chains, stochastic grammars, and monotone systems of non-linear equations. In Proc. of 22nd STACS'05. Springer, 2005. (Tech. Report, U. Edinburgh, June 2004).
13. [GGJ76] M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. In 8th ACM STOC, pages 10-22, 1976.
14. [Har63] T. E. Harris. The Theory of Branching Processes. Springer-Verlag, 1963.
15. [KwiOS] M. Kwiatkowska. Model checking for probability and time: from theory to practice. In Proc. 18th IEEE LICS, pages 351-360, 2003.
16. [MS99] C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
17. [PZ93] A. Pnueli and L. D. Zuck. Probabilistic verification. Inf. and Comp., 103(1):1-29, 1993.
18. [Ren92] J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts i,ii, iii. J. of Symbolic Computation, pages 255-352, 1992.
19. [Tiw92] P. Tiwari. A problem that is easier to solve on the unit-cost algebraic ram. Journal of Complexity, pages 393-397, 1992.
20. [Var85] M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. of 26th IEEE FOCS, pages 327-338, 1985.