Game logic is strong enough for parity games (2002) [2 citations — 2 self]
Download:
|
|
by Dietmar Berwanger, Mathematische Grundlagen Der Informatik, Rwth Aachen
Studia Logica. Special issue on Game Logic and Game Algebra
http://www-mgi.informatik.rwth-aachen.de/Publications/pub/dwb/helsinki.ps
Add To MetaCart
Abstract:
This paper is concerned with the expressive power of Parikh's Game Logic interpreted in Kripke structures. We show that the syntactical alternation hierarchy of this logic is strict, by expressing the winning condition for parity games with n priorities. Moreover, it follows that Game Logic is not captured by any nite level of the -calculus alternation hierarchy. We can further conclude that model checking for the -calculus is eciently solvable i this is possible for Game Logic. 1
Citations
| 155 | Tree automata, mu-calculus and determinacy (Extended abstract – Emerson, Jutla - 1991 |
| 49 | On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic – Janin, Walukiewicz - 1996 |
| 19 | On model checking for fragments of the mu-calculus – Emerson, Jutla, et al. - 1993 |
| 19 | Model checking and the Mu-calculus – Emerson - 1997 |
| 10 | The modal mu-calculus alternation hierarchy is strict – Brad - 1997 |
| 6 | Rudiments of -calculus, volume 146 – Arnold, Niwinski - 2001 |
