Abstract
Parity games (where the winner is determined by the parity of the maximal priority appearing infinitely often) were presented in Chapter 2 and algorithms solving parity games for the case of finite graphs in Chapter 7. In this paper we study parity games on a simple class of infinite graphs: the pushdown (transition) graphs. In [106], Kupferman and Vardi have given a very powerful method for the μ-calculus model checking of these graphs: the formalism of two-way alternating tree automata. This is a generalization of the (one-way) tree automata presented in Chapters 8 and 9.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cachat, T. (2002). Two-Way Tree Automata Solving Pushdown Games. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive