Pushdown games with unboundedness and regular conditions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Pushdown games with unboundedness and regular conditions

Résumé

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 Buchi 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.
Fichier principal
Vignette du fichier
unbounded-push.pdf (342.2 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00012141 , version 1 (17-10-2005)

Identifiants

  • HAL Id : hal-00012141 , version 1

Citer

Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz. Pushdown games with unboundedness and regular conditions. FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, 2003, Mumbai, India. pp.88-99. ⟨hal-00012141⟩
146 Consultations
229 Téléchargements

Partager

Gmail Facebook X LinkedIn More