The Descriptive Complexity of Parity Games

13 years 6 months ago

Download www.logic.rwth-aachen.de

We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in the modal

Anuj Dawar, Erich Grädel

Real-time Traffic

Automated Reasoning | CSL 2008 | Finite Game Graphs | Least-fixed Point Logic | Parity Games |

claim paper

Related Content

» On the Complexity of Parity Games

» The Complexity of PartialObservation Parity Games

» A Playful Glance at Hierarchical Questions for TwoWay Alternating Automata

» Permissive strategies from parity games to safety games

» Entanglement A Measure for the Complexity of Directed Graphs with Applications to Logic a...

» Learning Games from Videos Guided by Descriptive Complexity

» Fixpoint Logics on Hierarchical Structures

» Timed Parity Games Complexity and Robustness

» Precise Interval Analysis vs Parity Games

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CSL
Authors	Anuj Dawar, Erich Grädel

Comments (0)

Sciweavers

The Descriptive Complexity of Parity Games

Automated Reasoning | CSL 2008 | Finite Game Graphs | Least-fixed Point Logic | Parity Games |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers