Permissive strategies: From parity games to safety games

RAIRO - Theoretical Informatics and Applications

Volumn 36, Issue 3, 2002, Pages 261-275

  Bernet, Julien ^a   Janin, David ^a   Walukiewicz, Igor ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; THEOREM PROVING;

PARITY GAMES; PERMISSIVE STRATEGIES; SAFETY GAMES; UPPER BOUNDS;

GAME THEORY;

EID: 0036665928     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2002013     Document Type: Article

References (21)

1. A. Arnold, A. Vincent and I. Walukiewicz, Games for synthesis of controllers with partial observation. Theoret. Comput. Sci. (to appear).
2. A. Bergeron, A unified approach to control problems in discrete event processes. RAIRO: Theoret. Informatics Appl. 27 (1993) 555-573.
3. δσ. J. Symbolic Logic 48 (1983) 1171-1198.
4. C.G. Cassandras and S. LaFortune, Introduction to Discrete Event Systems. Kluwer Academic Publishers (1999).
5. S. Dziembowski, M. Jurdzinski and I. Walukiewicz, How much memory is needed to win infinite games, in LICS (1997) 99-110.
6. E.A. Emerson, C. Jutla and A. Sistla, On model-checking for fragments of μ-calculus, in CAV'93. Springer, Lecture Notes in Comput. Sci. 697 (1993) 385-396.
7. E.A. Emerson and C.S. Jutla, Tree automata, mu-calculus and determinacy, in Proc. FOCS 91 (1991) 368-377.
8. O. Grumberg, T. Heyman and A. Schusterk, Distributed symbolic model checking for mu-calculus, in CAV'01. Springer, Lecture Notes in Comput. Sci. 2102 (2001).
9. Y. Gurevich and L. Harrington, Trees, automata and games, in 14th ACM Symp. on Theory of Computations (1982) 60-65.
10. M. Jurdziński, Deciding the winner in parity games is in UP∩co-UP. Inform. Process. Lett. 68 (1998) 119-124.
11. M. Jurdziński, Small progress measures for solving parity games, in STACS. Springer, Lecture Notes in Comput. Sci. 1770 (2000) 290-301.
12. O. Kupferman, M. Y. Vardi and P. Wolper, An automata-theoretic approach to branching-time model checking. J. ACM 47 (2000).
13. A. W. Mostowski, Regular expressions for infinite trees and a standard form of automata, edited by A. Skowron, in Fifth Symposium on Computation Theory. Springer, Lecture Notes in Comput. Sci. 208 (1984) 157-168.
14. A. W. Mostowski, Hierarchies of weak automata and week monadic formulas. Theoret. Comput. Sci. 83 (1991) 323-335.
15. P.J.G. Ramadge and W.M. Wonham, The control of discrete event systems. Proc. of IEEE 77 (1989).
16. W. Thomas, Automata on infinite objects, edited by J. van Leeuven. Elsevier, Handb. Theoret. Comput. Sci. B (1990) 133-192.
17. W. Thomas, On the synthesis of strategies in infinite games in STACS '95. Springer, Lecture Notes in Comput. Sci. 900 (1995) 1-13.
18. W. Thomas, Languages, automata, and logic, edited by G. Rozenberg and A. Salomaa. Springer-Verlag, Handbook Formal Languages 3 (1997).
19. J. Vöge and M. Jurdziński, A discrete strategy improvement algorithm for solving parity games (Extended abstract), in CAV. Springer, Lecture Notes in Comput. Sci. 1855 (2000) 202-215.
20. W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoret. Comput. Sci. 200 (1998) 135-183.
21. U. Zwick and M. Paterson, The complexity of mean payoff games on graps. Theoret. Comput. Sci. 158 (1996) 343-359.