Complete classifiaction of computational complexity of the model-checking problem for probabilistic pushdown automata and qualitative fragments of the logics PCTL, PCTL* and PECTL* is reached.
Complete classifiaction of computational complexity of the model-checking problem for probabilistic pushdown automata and qualitative fragments of the logics PCTL, PCTL* and PECTL* is reached. (en)