Branching-Time Model-Checking of Probabilistic Pushdown Automata

Warning

This publication doesn't include Faculty of Arts. 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	2007
Type	Appeared in Conference without Proceedings
MU Faculty or unit	Faculty of Informatics
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:	Institute for Theoretical Computer Science Highly Parallel and Distributed Computing Systems