Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Journal of the ACM

Volumn 56, Issue 1, 2009, Pages

  Etessami, Kousha ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Columbia University ^*  (United States)

Author keywords

Monotone nonlinear systems; Multi type branching processes; Newton's method; Recursive Markov chains; Stochastic context free grammars

Indexed keywords

MONOTONE NONLINEAR SYSTEMS; MULTI-TYPE BRANCHING PROCESSES; NEWTON'S METHOD; RECURSIVE MARKOV CHAINS; STOCHASTIC CONTEXT-FREE GRAMMARS;

ALGORITHMS; COMPUTATIONAL GRAMMARS; CONTEXT FREE GRAMMARS; DECISION THEORY; MARKOV PROCESSES; NEWTON-RAPHSON METHOD; NONLINEAR SYSTEMS; PROBABILITY; PROGRAMMING THEORY; RANDOM PROCESSES; RECURSIVE FUNCTIONS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TELLURIC PROSPECTING;

NONLINEAR EQUATIONS;

EID: 60349107967     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1462153.1462154     Document Type: Article

References (64)

1. ABNEY, S., MCALLESTER, D., AND PEREIRA, F. 1999. Relating probabilistic grammars and automata. In Proceedings of the 37th Annual Meeting of the Association for Computing Linguistics. Morgan-Kaufman, San Francisco, CA, 542-549.
2. ALLENDER, E., BÜRGISSER, P., KJELDGAARD- PEDERSEN, J., AND MILTERSEN, P. B. 2006. On the complexity of numerical analysis. In Proceedings of the 21st IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 331-339.
3. 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.
4. ALUR, R., ETESSAMI, K., AND YANNAKAKIS, M. 2001. Analysis of recursive state machines. In Proceedings of the of 13th International Conference on Computer-Aided Verification. 304-313.
5. ALUR, R., AND YANNAKAKIS, M. 2001. Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst. 23, 3, 273-303.
6. ARKIN, E. M., PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1991. Modularity of cycles. J. ACM 38, 255-274.
7. ATHREYA, K. B., AND NEY, P. E. 1972. Branching processes. Springer-Verlag, Berlin, Germany.
8. ATHREYA, K. B., AND VIDYASHANKAR, A. N. 2001. Branching processes. In Stochastic Processes: Theory and Methods. Handbook of Statist., vol. 19. North-Holland, Amsterdam, the Netherlands, 35-53.
9. BALCER, Y., AND VEINOTT, A. F. 1973. Computing a graph's period quadratically by node condensation. Disc. Math. 4, 295-303.
10. BASU, S., POLLACK, R., AND ROY, M. F. 1996. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43, 6, 1002-1045.
11. BASU, S., POLLACK, F., AND ROY, M. F. 2003. Algorithms in Real Algebraic Geometry. Springer-Verlag, Berlin, Germany.
12. BENEDIKT, M., GODEFROID, P., AND REPS, T. 2001. Model checking of unrestricted hierarchical state machines. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). 652-666.
13. BERTONI, A., MAURI, G., AND SABADINI, N. 1981. A characterization of the class of functions computable in polynomial time on random access machines. In Proceedings of the 13th ACM Symposium on Theory of Computing (STOC). ACM, New York, 168-176.
14. BLUM, L., CUCKER, F., SHUB, M., AND SMALE, S. 1998. Complexity and Real Computation. Springer-Verlag, Berlin, Germany.
15. BOOTH, T. L., AND THOMPSON, R. A. 1973. Applying probability measures to abstract languages. IEEE Trans. Comput. 22, 5, 442-450.
16. BOUAJIANI, 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.
17. BRÁZDIL, T., ESPARZA, J., AND KUCERA, A. 2005a. Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 521-530.
18. BRÁZDIL, T., KUČERA, A., AND STRAŽOVSKÝ, O. 2005b. Decidability of temporal properties of probabilistic pushdown automata. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS).
19. CANNY, J. 1988. Some algebraic and geometric computations in PSPACE. In Proceedings of the 20th ACM Symposium on Theory of Computing (STOC). ACM, New York, 460-467.
20. CHI, Z., AND GEMAN, S. 1998. Estimation of probabilistic context-free grammars. Computat. Ling. 24, 2, 298-305.
21. DURBIN, R., EDDY, S. R., KROGH, A., AND MITCHISON, G. 1999. Biological Sequence Analysis: Probabilistic models of Proteins and Nucleic Acids. Cambridge Univ., Press, Cambridge, MA.
22. ESPARZA, J., HANSEL, D., ROSSMANITH, P., AND SCHWOON, S. 2000. Efficient algorithms for model checking pushdown systems. In Proceedings of the 12th International Conference on Computer-Aided Verification (CAV). 232-247.
23. ESPARZA, J., KIEFER, S., AND LUTTENBERGER, M. 2008. Convergence thresholds of Newton's method for monotone polynomial equations. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS). 289-300.
24. 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). IEEE Computer Society Press, Los Alamitos, CA, 12-21.
25. ESPARZA, J., KUČERA, A., AND MAYR, R. 2005. Quantitative analysis of probabilistic pushdown automata: expectations and variances. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA.
26. ETESSAMI, K., WOJTCZAK, D., AND YANNAKAKIS, M. 2008. Quasi-birth-death processes, tree-like QBDS, probabilistic 1-counter automata, and pushdown systems. In Proceedings of the 5th International Symposium on Quantitative Evaluation of Systems (QEST). 243-253.
27. 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.
28. ETESSAMI, K., AND YANNAKAKIS, M. 2005b. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). 340-352.
29. ETESSAMI, K., AND YANNAKAKIS, M. 2005c. Recursive Markov decision processes and recursive stochastic games. In Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP). 891-903.
30. ETESSAMI, K., AND YANNAKAKIS, M. 2006a. Efficient analysis of classes of recursive Markov decision processes and stochastic games. In Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS). 634-645.
31. ETESSAMI, K., AND YANNAKAKIS, M. 2006b. Recursive concurrent stochastic games. In Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP). 324-335.
32. ETESSAMI, K., AND YANNAKAKIS, M. 2007. On the complexity of Nash equilibria and other fixed points. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 113-123.
33. EVERETT, C. J., AND ULAM, S. 1948. Multiplicative systems, Part I., II, and III. Tech. Rep. 683,690,707, LOS Alamos Scientific Laboratory.
34. 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). ACM, New York, 484-493.
35. 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.
36. GRENANDER, U. 1976. Lectures on Pattern Theory, Vol. 1. Springer-Verlag.
37. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1993. Geometric Algorithms and Combinatorial Optimization, 2nd ed. Springer-Verlag, Berlin, Germany.
38. HACCOU, P., JAGERS, P., AND VATUTIN, V. A. 2005. Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge Univ. Press, Cambridge, UK.
39. HARRIS, T. E. 1963. The Theory of Branching Processes. Springer-Verlag, Berlin, Germany.
40. HOPCROFT, J., MOTWANI, R., AND ULLMAN, J. D. 2000. Introduction to Automata Theory, Languages, and Computation. Addisson-Wesley, Reading, MA.
41. HORN, R. J., AND J OHNSON, C. R. 1985. Matrix Analysis. Cambridge Univ. Press, Cambridge, UK.
42. JAGERS, P. 1975. Branching Processes with Biological Applications. Wiley, New York.
43. KABANETS, V, AND IMPAGLIAZZO, R. 2003. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC). ACM, New York, 355-364.
44. KARLIN, S. 1966. A First Course in Stochastic Processes. Academic Press, Orlando, FL.
45. KIEFER, S., LUTTENBERGER, M., AND ESPARZA, J. 2007. On the convergence of newton's method for monotone systems of polynomial equations. In Proceedings of the 39th Symposium on Theory of Computing (STOC). ACM, New York, 217-226.
46. KIMMEL, M., AND AXELROD, D. E. 2002. Branching processes in biology. Springer-Verlag, Berlin, Germany.
47. KOLMOGOROV, A. N., AND SEVASTYANOV, B. A. 1947. The calculation of final probabilities for branching random processes. Dokaldy 56, 783-786. (Russian).
48. LANCASTER, P., AND TISMENETSKY, M. 1985. The Theory of Matrices, 2nd ed. Academic Press, Orlando, FL.
49. LATOUCHE, G., AND RAMASWAMI, V. 1999. Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM series on statistics and applied probability.
50. MANNING, C., AND SCHÜTZE, H. 1999. Foundations of Statistical Natural Language Processing. MIT Press, Cambridge, MA.
51. MODE, C. J. 1971. Multitype Branching Processes. Theory and Applications. Modern Analytic and Computational Methods in Science and Mathematics, No. 34. American Elsevier.
52. NEDERHOF, M. J., AND SATTA, G. 2008. Computing partition functions of PCFGs. Res. Lang. Computat. 6, 2, 139-162.
53. NEUTS, M. F. 1981. Matrix-Geometric Solutions in Stochastic Modelsan algorithmic approach. Johns Hopkins Univ. Press, Baltimore, MD.
54. ORTEGA, J. M., AND RHEINBOLT, W. 1970. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, Orlando, FL.
55. RENEGAR, J. 1992. On the computational complexity and geometry of the first-order theory of the reals, parts I-III. J. Symbol. Computat. 13, 3, 255-352.
56. REPS, T. 1998. Program analysis via graph reachability. Inf. Softw. Tech. 40, 11-12, 701-726.
57. SAKAKIBARA, Y., BROWN, M., HUGHEY, R., MIAN, I., SJOLANDER, K., UNDERWOOD, R., AND HAUSSLER, D. 1994. Stochastic context-free grammars for tRNA modeling. Nuc. Acids Res. 22, 23, 5112-5120.
58. SCHÖNHAGE, A. 1979. On the power of random access machines. In Proceedings of the 6th International Colloquium on Automata, Languages, and Programming (ICALP). 520-529.
59. SEVASTYANOV, B. A. 1951. The theory of branching processes. Uspehi Mathemat. Nauk 6, 47-99. (Russian).
60. STEWART, I. 1989. Galois Theory, 2nd ed. Chapman & Hall, London, UK.
61. STOER, J., AND BULIRSCH, R. 1993. Introduction to Numerical Analysis. Springer-Verlag, Berlin, Germany.
62. TIWARI, P. 1992. A problem that is easier to solve on the unit-cost algebraic ram. J. Complexity. 393-397.
63. WOJTCZAK, D., AND ETESSAMI, K. 2007. Premo: An analyzer for probabilistic recursive models. In Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). 66-71.
64. 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.