A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
BRICS Report Series
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.doi:10.7146/brics.v3i54.20057 fatcat:pzvwnk4otbbuvcu2s2olplfizq