Pushdown Processes: Games and Model Checking

Abstract

Games given by transition graphs of pushdown processes are considered.<br />It is shown that if there is a winning strategy in such a<br />game then there is a winning strategy that is realized by a pushdown<br />process. This fact turns out to be connected with the model checking<br />problem for the pushdown automata and the propositional mu-calculus.<br />It is shown that this model checking problem is DEXPTIME-complete.