Branching-Time Model-Checking of Probabilistic Pushdown Automata

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš BROŽEK Václav FOREJT Vojtěch

Year of publication 2009
Type Article in Periodical
Magazine / Source Electronic Notes in Theoretical Computer Science
MU Faculty or unit

Faculty of Informatics

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:

You are running an old browser version. We recommend updating your browser to its latest version.