Uniform Solution of Parity Games on Prefix-Recognizable Graphs
نویسنده
چکیده
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable graphs. The winning regions of the players are proved to be effectively regular, and winning strategies are computed.
منابع مشابه
15 Prefix-Recognizable Graphs and Monadic Logic
In 1969, Rabin [148] showed that the monadic second-order theory (MSO-theory) of infinite binary trees is decidable (see Chapter 12 of this volume or [183]). Ever since, it has been an interesting goal to extend this result to other classes of objects. Muller and Schupp [135] showed that the class of pushdown graphs has a decidable MSO-theory. This class is obtained by considering the configura...
متن کاملReachability on prefix-recognizable graphs
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability.
متن کاملFormats of Winning Strategies for Six Types of Pushdown Games
The solution of parity games over pushdown graphs (Walukiewicz ’96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for pushdown games can be implemented again as pushdown automata. We continue this study and investigate the connection between game presentations and winning strategies in altogether six cases of game arenas, among them...
متن کاملAdding Monotonic Counters to Automata and Transition Graphs
We analyze models of infinite-state automata extended by monotonic counting mechanisms, starting from the (finite-state) Parikh automata studied by Klaedtke and Rueß. We show that, for linearbounded automata, this extension does not increase the language recognition power. In the framework of infinite transition systems developed by Caucal and others, we show that adding monotonic counters to s...
متن کاملParity Games on Undirected Graphs Can Be Hard, Too
We discuss the computational complexity of solving parity games in the special case when the underlying game graph is undirected. For strictly alternating games, that is, when the game graph is bipartite between the nodes of the two players, we show that the games can be solved in linear time. However, when strict alternation is not imposed, we show that computing a solution is as hard in the u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 68 شماره
صفحات -
تاریخ انتشار 2002