Solving parity games in big steps

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

Volumn 4855 LNCS, Issue , 2007, Pages 449-460

  Schewe, Sven ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

OPTIMAL PARAMETER BALANCES; PARITY GAMES;

INTERACTIVE COMPUTER GRAPHICS;

EID: 38349008477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77050-3_37     Document Type: Conference Paper

References (25)

1. Kozen, D.: Results on the propositional μ-calculus. Theor. Comput. Sci. 27, 333-354 (1983)
2. Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of μ-calculus. In: CAV, pp. 385-396 (1993)
3. de Alfaro, L., Henzinger, T.A., Majumdar, R.: From verification to control: Dynamic programs for omega-regular objectives. In: Proc. LICS, June 2001, pp. 279-290. IEEE Computer Society Press, Los Alamitos (2001)
4. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672-713 (2002)
5. Wilke, T.: Alternating tree automata, parity games, and modal μ-calculus. Bull. Soc. Math. Belg. 8(2) (2001)
6. Kupferman, O., Vardi, M.Y.: Module checking revisited. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 36-47. Springer, Heidelberg (1997)
7. Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628-641. Springer, Heidelberg (1998)
8. Schewe, S., Finkbeiner, B.: The alternating-time μ-calculus and automata over concurrent game structures. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 591-605. Springer, Heidelberg (2006)
9. Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. In: Proc. LICS, pp. 255-264. IEEE Computer Society Press, Los Alamitos (2006)
10. Schewe, S., FinkbUeiner, B.: Synthesis of asynchronous systems. In: LOPSTR 2006, pp. 127-142. Springer, Heidelberg (2006)
11. McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65(2), 149-184 (1993)
12. Emerson, E.A., Lei, C.: Efcient model checking in fragments of the propositional over calculus. In: Proc., LICS, pp. 267-278. IEEE Computer Society Press, Los Alamitos (1986)
13. Ludwig, W.: A subexponential randomized algorithm for the simple stochastic game problem. Inf. Comput. 117(1), 151-155 (1995)
14. Puri, A.: Theory of hybrid systems and discrete event systems. PhD thesis, Computer Science Department, University of California, Berkeley (1995)
15. Zwick, U., Paterson, M.S.: The complexity of mean payoff games on graphs. Theoretical Computer Science 158(1-2), 343-359 (1996)
16. Browne, A., Clarke, E.M., Jha, S., Long, D.E., Marrero, W.: An improved algorithm for the evaluation of fixpoint expressions. Theoretical Computer Science 178(1-2), 237-255 (1997)
17. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1-2), 135-183 (1998)
18. Jurdziriski, M.: Deciding the winner in parity games is in UP ⊃ co-UP. Information Processing Letters 68(3), 119-124 (1998)
19. 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)
20. Vöge, J., Jurdziński, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202-215. Springer, Heidelberg (2000)
21. Obdržá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)
22. Lange, M.: Solving parity games by a reduction to SAT. In: Majumdar, R., Jurdziski, M. (eds.) Proc. Int. Workshop on Games in Design and Verification (2005)
23. 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. 436-524. Springer, Heidelberg (2006)
24. Jurdziński, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. In: Proc. SODA, ACM/SIAM, pp. 117-123 (2006)
25. Björklund, H., Vorobyov, S.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Appl. Math. 155(2), 210-229 (2007)