Publication details
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Authors | |
---|---|
Year of publication | 2009 |
Type | Article in Periodical |
Magazine / Source | Electronic Notes in Theoretical Computer Science |
MU Faculty or unit | |
Citation | |
Web | http://dx.doi.org/10.1016/j.entcs.2009.05.031 |
Field | Informatics |
Keywords | model-checking; Markov chains; temporal logics; probabilistic pushdown automata |
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: |