Model checking of recursive probabilistic systems

ACM Transactions on Computational Logic

Volumn 13, Issue 2, 2012, Pages

  Etessami, Kousha ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

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

Author keywords

B chi automata; Markov Chains; Model checking; Probabilistic systems; Pushdown Systems; Recursive systems; Stochastic context free grammars; Temporal Logic

Indexed keywords

ABSTRACT MODELS; DETERMINISTIC AUTOMATA; EXPONENTIAL TIME; LINEAR TEMPORAL LOGIC; LOWER BOUNDS; LTL FORMULAE; LTL PROPERTY; NUMERICAL COMPUTATIONS; OPEN PROBLEMS; POLYNOMIAL SPACE; POLYNOMIAL-TIME; PROBABILISTIC PROGRAMS; PROBABILISTIC PUSHDOWN SYSTEMS; PROBABILISTIC SYSTEMS; PUSHDOWN SYSTEMS; QUALITATIVE MODEL; QUANTITATIVE MODEL CHECKING; REACHABILITY ANALYSIS; RECURSIONS; RECURSIVE MARKOV CHAINS; RELATED SYSTEMS; STOCHASTIC CONTEXT FREE GRAMMAR; TIME POLYNOMIALS; UPPER BOUND;

ALGORITHMS; AUTOMATA THEORY; CONTEXT FREE GRAMMARS; EQUIVALENCE CLASSES; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; PROBABILITY; SPECIFICATIONS; TEMPORAL LOGIC;

MODEL CHECKING;

EID: 84860308014     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/2159531.2159534     Document Type: Article

References (26)

1. ALLENDER, E., BÜRGISSER, P., KJELDGAARD-PEDERSEN, J., AND MILTERSEN, P. B. 2009. On the complexity of numerical analysis. SIAM J. Comput. 38, 5, 1987-2006.
2. ALUR, R., BENEDIKT, M., ETESSAMI, K., GODEFROID, P., REPS, T., AND YANNAKAKIS, M. 2005. Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27, 4, 786-818. (Pubitemid 43942505)
3. BILLINGSLEY, P. 1995. Probability and Measure 3rd Ed. J. Wiley and Sons.
4. BOUAJJANI, A., ESPARZA, J., AND MALER, O. 1997. Reachability analysis of pushdown automata: Applications to model checking. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR). 135-150. (Pubitemid 127089315)
5. BRÁZDIL, T., KUČERA, A., AND STRAŽOVSKÝ, O. 2005. Decidability of temporal properties of probabilistic pushdown automata. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS).
6. CANNY, J. 1988. Some algebraic and geometric computations in PSPACE. In Proceedings of the 20th ACM Symposium on Theory of Computing (STOC). 460-467.
7. COURCOUBETIS, C. AND YANNAKAKIS, M. 1995. The complexity of probabilistic verification. J. ACM 42, 4, 857-907.
8. DURBIN, R., EDDY, S. R., KROGH, A., AND MITCHISON, G. 1999. Biological Sequence Analysis: Probabilistic models of Proteins and Nucleic Acids. Cambridge University Press.
9. ESPARZA, J., KUČERA, A., AND MAYR, R. 2004. Model checking probabilistic pushdown automata. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS). 12-21.
10. ETESSAMI, K. AND YANNAKAKIS, M. 2005a. Algorithmic verification of recursive probabilistic state machines. In Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). 253-270. (Pubitemid 41273746)
11. ETESSAMI, K. AND YANNAKAKIS, M. 2005b. Recursive Markov decision processes and recursive stochastic games. In Proceedings of the 32nd International Coll. on Automata, Languages, and Programming (ICALP). 891-903. (Pubitemid 41436155)
12. ETESSAMI, K. AND YANNAKAKIS, M. 2009. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56, 1.
13. FAGIN, R., KARLIN, A., KLEINBERG, J., RAGHAVAN, P., RAJAGOPALAN, S., RUBINFELD, R., SUDAN, M., AND TOMKINS, A. 2000. Random walks with "back buttons" (extended abstract). In Proceedings of the ACM Symposium on Theory of Computing (STOC). 484-493.
14. GAREY, M. R., GRAHAM, R. L., AND JOHNSON, D. S. 1976. Some NP-complete geometric problems. In Proceedings of the 8th ACM Symposium on Theory of Computing (STOC). 10-22.
15. HACCOU, P., JAGERS, P., AND VATUTIN, V. A. 2005. Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge University Press.
16. HARRIS, T. E. 1963. The Theory of Branching Processes. Springer.
17. KIMMEL, M. AND AXELROD, D. E. 2002. Branching Processes in Biology. Springer.
18. KWIATKOWSKA, M. 2003. Model checking for probability and time: from theory to practice. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science. 351-360.
19. MANNING, C. AND SCHÜTZE, H. 1999. Foundations of Statistical Natural Language Processing. MIT Press.
20. PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the 18th Symposium on Foundations of Computer Science. 46-57.
21. PNUELI, A. AND ZUCK, L. D. 1993. Probabilistic verification. Inf. Comput. 103, 1, 1-29.
22. RENEGAR, J. 1992. On the computational complexity and geometry of the first-order theory of the reals, parts I-III. J. Symb. Comput. 13, 3, 255-352.
23. TIWARI, P. 1992. A problem that is easier to solve on the unit-cost algebraic ram. J. Complex. 393-397.
24. VARDI, M. 1985. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the of 26th IEEE FOCS. 327-338. (Pubitemid 16541431)
25. VARDI, M. Y. AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st Symposium on Logic in Comp. Sci. (LICS). 322-331.
26. YANNAKAKIS, M. AND ETESSAMI, K. 2005. Checking LTL properties of Recursive Markov Chains. In Proceedings of the 2nd International Symposium on Quantitative Evaluation of Systems (QEST). 155-165.