Abstract
We consider infinite two-player games on pushdown graphs, the reachability game where the first player must reach a given set of vertices to win, and the Büchi game where he must reach this set infinitely often. We provide an automata theoretic approach to compute uniformly the winning region of a player and corresponding winning strategies, if the goal set is regular. Two kinds of strategies are computed: positional ones which however require linear execution time in each step, and strategies with pushdown memory where a step can be executed in constant time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, CONCUR’ 97, LNCS 1243, pp 135–150, 1997.
A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper, An efficient automata approach to some problems on context-free grammars, Information Processing Letters, Vol 74, 2000.
D. Caucal, On the regular structure of prefix rewriting, CAAP’ 90, LNCS 431, pp. 87–102, 1990.
O. Corolleur, Etude de jeux sur les graphes de transitions des automates à pile, Rapport de stage d’option informatique, Ecole Polytechnique, 2001.
E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, FoCS’ 91, IEEE Computer Society Press, pp. 368–377, 1991.
E. A. Emerson, C. S. Jutla, and A. P. Sistla, On model-checking for fragments of μ-calculus, CAV’ 93, LNCS 697, pp. 385–396, 1993.
J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon, Efficient Algorithm for Model Checking Pushdown Systems, Technische Universität München, 2000.
O. Kupferman and M. Y. Vardi, An Automata-Theoretic Approach to Reasoning about Infinite-State Systems, CAV 2000, LNCS 1855, 2000.
O. Kupferman and M. Y. Vardi, Weak Alternating Automata Are Not That Weak, ISTCS’97, IEEE Computer Society Press, 1997.
C. Löding and W. Thomas, Alternating Automata and Logics over Infinite Words, IFIPTCS’ 00, LNCS 1872, pp. 521–535, 2000.
W. Thomas, On the synthesis of strategies in infinite games, STACS’ 95, LNCS 900, pp. 1–13, 1995.
I. Walukiewicz, Pushdown processes: games and model checking, CAV’ 96, LNCS 1102, pp 62–74, 1996. Full version in Information and Computation 157, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cachat, T. (2002). Symbolic Strategy Synthesis for Games on Pushdown Graphs. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_60
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive