Regularity in Model Checking PDA Games

Warning

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

Authors	BROŽEK Václav
Year of publication	2007
Type	Article in Proceedings
Conference	MEMICS proceedings
MU Faculty or unit	Faculty of Informatics
Citation
Web	http://is.muni.cz/www/99081/6046298/reg_conf.pdf
Field	Informatics
Keywords	regular languages; probabilistic pushdown games; reachability
Description	Regularity of sets of configurations satisfying a given probabilistic reachability objective in PDA games was classified up to 1 1/2 player games in general and 2 1/2 player games for termination objective.
Related projects:	Institute for Theoretical Computer Science Highly Parallel and Distributed Computing Systems