Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Symbolic Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Languages, automata, and logic
Handbook of formal languages, vol. 3
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the Complexity of Numerical Analysis
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Computing the Least Fixed Point of Positive Polynomial Systems
SIAM Journal on Computing
On probabilistic parallel programs with process creation and synchronisation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Model Checking of Recursive Probabilistic Systems
ACM Transactions on Computational Logic (TOCL)
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
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.