The descriptive complexity of parity games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5213 LNCS, Issue , 2008, Pages 354-368

  Dawar, Anuj ^a   Grädel, Erich ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CRYSTAL LATTICES; FUNCTIONS; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS;

BISIMULATION; DESCRIPTIVE COMPLEXITIES; FIXED POINTS; GAME GRAPHS; PARITY GAMES; POLYNOMIAL TIMES;

GAME THEORY;

EID: 57849142936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-426     Document Type: Conference Paper

References (25)

1. Abiteboul, S., Vardi, M.Y., Vianu, V.: Fixpoint logics, relational machines, and computational complexity. J. ACM 44(1), 30-46 (1997)
2. Abiteboul, S., Vianu, V.: Computing with first-order logic. Journal of Computer and System Sciences 50(2), 309-335 (1995)
3. Arnold, A.: The mu-calculus alternation-depth is strict on binary trees. RAIRO Informatique Théorique et Applications 33, 329-339 (1999)
4. Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: Dag-width and parity games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 524-536. Springer, Heidelberg (2006)
5. Berwanger, D., Grädel, E.: Fixed-point logics and solitaire games. Theory of Computing Systems 37, 675-694 (2004)
6. Berwanger, D., Grädel, E.: Entanglement - A measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 209-223. Springer, Heidelberg (2005)
7. Bradfield, J.: The modal p-calculus alternation hierarchy is strict. Theoretical Computer Science 195, 133-153 (1998)
8. Courcelle, B.: The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications. Theoretical Computer Science 299, 1-36 (2003)
9. Dawar, A., Gurevich, Y.: Fixed point logics. Bulletin of Symbolic Logic 8, 65-88 (2002)
10. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)
11. Emerson, A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368-377 (1991)
12. Grädel, E., et al: Finite Model Theory and Its Applications. Springer, Heidelberg (2007)
13. Grädel, E., Hirsch, C., Otto, M.: Back and forth between guarded and modal logics. ACM Transactions on Computational Logic 3, 418-463 (2002)
14. Grädel, E., Walukiewicz, I.: Positional determinacy of games with infinitely many priorities. Logical Methods in Computer Science (2006)
15. Hunter, P.: Complexity and Infinite Games on Finite Graphs. PhD thesis, University of Cambridge (2007)
16. Jurdziński, M.: Deciding the winner in parity games is in UP ∩ Co-UP. Information Processing Letters 68, 119-124 (1998)
17. Jurdziński, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290-301. Springer, Heidelberg (2000)
18. Jurdziński, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: Proceedings of ACM-SIAM Proceedings on Discrete Algorithms, SODA 2006, pp. 117-123 (2006)
19. Mostowski, A.: Games with forbidden positions. Technical Report Tech. Report 78, University of Gdansk (1991)
20. Obdrzálek, J.: Fast mu-calculus model checking when tree-width is bounded. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 80-92. Springer, Heidelberg (2003)
21. Obdrzálek, J.: DAG-width - connectivity measure for directed graphs. In: Proceedings of ACM-SIAM Proceedings on Discrete Algorithms, SODA 2006, pp. 814-821 (2006)
22. Obdrzálek, J.: Clique-width and parity games. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 54-68. Springer, Heidelberg (2007)
23. Otto, M.: Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science 224, 237-265 (1999)
24. Stirling, C.: Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh (1997)
25. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 135-183 (1998)