Quantitative analysis of probabilistic pushdown automata: Expectations and variances

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 117-126

  Esparza, Javier ^a   Kučera, Antonín ^b   Mayr, Richard ^c  

^a UNIVERSITY OF STUTTGART   (Germany)

^b MASARYK UNIVERSITY   (Czech Republic)

^c North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILISTIC PROGRAMS; PROBABILISTIC PUSHDOWN AUTOMATA (PPDA); PROBABILISTIC TEMPORAL LOGICS; TEMPORAL LOGIC;

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING;

PROBABILISTIC LOGICS;

EID: 26844538915     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2005.39     Document Type: Conference Paper

References (15)

1. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In Proc. TACAS 2004, LNCS 2988, p. 467-481. Springer, 2004.
2. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. CAV 2001, LNCS 2102, p. 207-220. Springer, 2001.
3. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proc. STOC 2004, p. 202-211. ACM Press, 2004.
4. M. Benedikt, P. Godefroid, and T.W. Reps. Model checking of unrestricted hierarchical state machines. In Proc. ICALP'2001, LNCS 2076, p. 652-666. Springer, 2001.
5. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: application to model checking. In Proc. CONCUR'97, LNCS 1243, 135-150. Springer, 1997.
6. T. Brázdil, A. Kučera, and O. Stražovský. On the decidability of temporal properties of probabilistic pushdown automata. In Proc. STACS'2005, LNCS 3404, p. 145-157. Springer, 2005.
7. J. Canny. Some algebraic and geometric computations in PSPACE. In Proc. STOC'88, p. 460-467. ACM Press, 1988.
8. S. Chaudhuri, R. Alur, K. Etessami, and P. Madhusudan. On-the-fly reachability and cycle detection for recursive state machines. In Proc. TACAS 2005, LNCS 3440. Springer, 2005.
9. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proc. LICS'98, p. 454-465. IEEE, 1998.
10. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. CAV 2000, LNCS 1855, p. 232-247. Springer, 2000.
11. J. Esparza, A. Kučera, and R. Mayr. Model-checking probabilistic pushdown automata. In Proc. LICS 2004, p. 12-21. IEEE, 2004.
12. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic systems. In Proc. TACAS 2005, LNCS 3440, p. 253-270. Springer, 2005.
13. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. In Proc. STACS'2005, LNCS 3404, p. 340-352. Springer, 2005.
14. D. Grigoriev. Complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5(1-2):65-108, 1988.
15. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, 1951.