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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
