Oxford logo
[CDK12] T. Chen, K. Draeger, S. Kiefer. Model Checking Stochastic Branching Processes. In B. Rovan, V. Sassone, P. Widmayer (editor), Proceedings 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 7464 of LNCS, pages 271-282, Springer. 2012. [pdf] [bib]
Downloads:  pdf pdf (357 KB)  bib bib
Notes: The original publication is available at www.springerlink.com.
Abstract. Stochastic branching processes are a classical model for describing random trees, which have applications in numerous fields including biology, physics, and natural language processing. In particular, they have recently been proposed to describe parallel programs with stochastic process creation. In this paper, we consider the problem of model checking stochastic branching process. Given a branching process and a deterministic parity tree automaton, we are interested in computing the probability that the generated random tree is accepted by the automaton. We show that this probability can be compared with any rational number in PSPACE, and with 0 and 1 in polynomial time. In a second part, we suggest a tree extension of the logic PCTL, and develop a PSPACE algorithm for model checking a branching process against a formula of this logic. We also show that the qualitative fragment of this logic can be model checked in polynomial time.