We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive manner. They offer a natural abstract model for probabilistic programs with procedures, and are a probabilistic version of Recursive State Machines. RMCs generalize Stochastic Context-Free Grammars (SCFG) and multi-type Branching Processes, and are intimately related to Probabilistic Pushdown Systems. We focus here on termination and reachability analysis for RMCs. We present both positive and negative results for the general class of RMCs, as well as for important subclasses including SCFGs. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Etessami, K., & Yannakakis, M. (2005). Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In Lecture Notes in Computer Science (Vol. 3404, pp. 340–352). Springer Verlag. https://doi.org/10.1007/978-3-540-31856-9_28
Mendeley helps you to discover research relevant for your work.