Linear Time Algorithm for Weak Parity Games
نویسنده
چکیده
We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algorithm. We present a linear time algorithm for solving weak-parity games.
منابع مشابه
Weak Parity Games and Language Containment of Weak Alternating Parity Automata
Optimisations of the state space of weak alternating parity automata (WAPA) are needed for example to speed up μTL model-checking algorithms which involve WAPA. It is assumed that deciding language containment for WAPA is helpful to perform such optimisations. In this paper the problem of language containment is reduced to the problem of computing winning sets in weak parity games. For the latt...
متن کاملRecursive Solving Of Parity Games Requires Exponential Time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
متن کاملRecursive algorithm for parity games requires exponential time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
متن کاملLinear Complementarity Algorithms for Infinite Games
The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have not been previously studied in the context of infinite games, and they offer alternatives to the classical strategy-improvement algorithms. The two algorithm...
متن کاملZielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free μ-calculus and ECTL∗ model checking problems. These classes can be solved in polynomial time using dedicated algorithms. We investigate the complexity of Zielonka’s Recursive algorithm for solving these special games, showing that the algorithm runs in O(d · (n+m)) on weak game...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0805.1391 شماره
صفحات -
تاریخ انتشار 2006