Branching-Time Model-Checking of Probabilistic Pushdown Automata
| Authors | |
|---|---|
| Year of publication | 2007 |
| Type | Appeared in Conference without Proceedings |
| MU Faculty or unit | |
| Citation | |
| Description | 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. |
| Related projects: |