Pushdown Games with Unboundedness and Regular Conditions

@inproceedings{Bouquet2003PushdownGW,
  title={Pushdown Games with Unboundedness and Regular Conditions},
  author={Alexis-Julien Bouquet and Olivier Serre and Igor Walukiewicz},
  booktitle={FSTTCS},
  year={2003}
}
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning conditions are Boolean combinations of a Büchi condition and a new condition that we call unboundedness. An infinite play satisfies the unboundedness condition if there is no bound on the size of the stack during the play. We show that the problem of deciding a winner in such games is EXPTIME-complete. 
BETA

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…