A survey of stochastic ω-regular games

Journal of Computer and System Sciences

Volumn 78, Issue 2, 2012, Pages 394-413

  Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^a,b  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b EPFL   (Switzerland)

Author keywords

Game theory; Stochastic games; Regular objectives

Indexed keywords

STOCHASTIC SYSTEMS;

GRAPH GAMES; REACTIVE SYSTEM; STOCHASTIC GAME; TWO-PLAYER GAMES; ZERO SUMS;

GAME THEORY;

EID: 84856020014     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.05.002     Document Type: Article

References (96)

1. M. Abadi, L. Lamport, and P. Wolper Realizable and unrealizable specifications of reactive systems ICALP89 Lecture Notes in Comput. Sci. vol. 372 1989 Springer 1 17
2. R. Alur, T.A. Henzinger, and O. Kupferman Alternating-time temporal logic J. ACM 49 2002 672 713
3. R. Alur, T.A. Henzinger, O. Kupferman, and M.Y. Vardi Alternating refinement relations CONCUR98 Lecture Notes in Comput. Sci. vol. 1466 1998 Springer 163 178 (Pubitemid 128125355)
4. C. Beeri On the membership problem for functional and multivalued dependencies in relational databases ACM Trans. Database Syst. 5 1980 241 259 (Pubitemid 11451515)
5. H. Björklund, S. Sandberg, and S. Vorobyov A discrete subexponential algorithms for parity games STACS03 Lecture Notes in Comput. Sci. vol. 2607 2003 Springer 663 674
6. H. Björklund, S. Sandberg, S. Vorobyov, Randomized subexponential algorithms for infinite games, Technical report: DIMACS 2004-09, 2004.
7. A. Blass, Y. Gurevich, L. Nachmanson, M. Veanes, Play to test, in: FATES05, 2005.
8. J.R. Büchi On a decision method in restricted second-order arithmetic E. Nagel, P. Suppes, A. Tarski, Proceedings of the First International Congress on Logic, Methodology, and Philosophy of Science 1960 1962 Stanford University Press 1 11
9. J.R. Büchi, and L.H. Landweber Solving sequential conditions by finite-state strategies Trans. Amer. Math. Soc. 138 1969 295 311
10. K. Chatterjee Two-player nonzero-sum ω-regular games CONCUR05 Lecture Notes in Comput. Sci. vol. 3653 2005 Springer 413 427
11. K. Chatterjee Optimal strategy synthesis for stochastic Müller games FoSSaCS07 Lecture Notes in Comput. Sci. vol. 4423 2007 Springer 138 152 (Pubitemid 350262665)
12. K. Chatterjee Stochastic Müller games are PSPACE-complete FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Comput. Sci. vol. 4855/2007 2007 436 448
13. K. Chatterjee, Stochastic ω-regular games, PhD thesis, UC Berkeley, 2007.
14. K. Chatterjee, L. de Alfaro, T.A. Henzinger, Trading memory for randomness, in: QEST04, IEEE, 2004, pp. 206-217. (Pubitemid 40456777)
15. K. Chatterjee, L. de Alfaro, and T.A. Henzinger The complexity of stochastic Rabin and Streett games ICALP05 Lecture Notes in Comput. Sci. vol. 3580 2005 Springer 878 890 (Pubitemid 41436154)
16. K. Chatterjee, L. de Alfaro, T.A. Henzinger, The complexity of quantitative concurrent parity games, in: SODA06, ACM-SIAM, 2006, pp. 678-687. (Pubitemid 43275289)
17. K. Chatterjee, L. de Alfaro, T.A. Henzinger, Strategy improvement in concurrent reachability games, in: QEST06, IEEE, 2006, pp. 291-300. (Pubitemid 351424371)
18. K. Chatterjee, L. Doyen, T.A. Henzinger, and J.F. Raskin Algorithms for omega-regular games with imperfect information CSL06 Lecture Notes in Comput. Sci. vol. 4207 2006 Springer 287 302 (Pubitemid 44617564)
19. K. Chatterjee, and T.A. Henzinger Semiperfect-information games FSTTCS05 Lecture Notes in Comput. Sci. vol. 3821 2005 Springer 1 18 (Pubitemid 43846891)
20. K. Chatterjee, and T.A. Henzinger Strategy improvement and randomized subexponential algorithms for stochastic parity games STACS06 Lecture Notes in Comput. Sci. vol. 3884 2006 Springer 512 523 (Pubitemid 43990452)
21. K. Chatterjee, and T.A. Henzinger Strategy improvement for stochastic Rabin and Streett games CONCUR06 Lecture Notes in Comput. Sci. vol. 4137 2006 Springer 375 389 (Pubitemid 44532587)
22. K. Chatterjee, T.A. Henzinger, M. Jurdziński, Games with secure equilibria, in: LICS04, IEEE, 2004, pp. 160-169.
23. K. Chatterjee, T.A. Henzinger, and N. Piterman Generalized parity games FoSSaCS07 Lecture Notes in Comput. Sci. vol. 4423 2007 Springer 153 167 (Pubitemid 350259701)
24. K. Chatterjee, M. Jurdziński, and T.A. Henzinger Simple stochastic parity games CSL03 Lecture Notes in Comput. Sci. vol. 2803 2003 Springer 100 113
25. K. Chatterjee, M. Jurdziński, T.A. Henzinger, Quantitative stochastic parity games, in: SODA04, SIAM, 2004, pp. 121-130.
26. K. Chatterjee, R. Majumdar, and T.A. Henzinger Stochastic limit-average games are in EXPTIME Internat. J. Game Theory 37 2008 219 234
27. K. Chatterjee, R. Majumdar, and M. Jurdziński On Nash equilibria in stochastic games CSL04 Lecture Notes in Comput. Sci. vol. 3210 2004 Springer 26 40 (Pubitemid 39751577)
28. A. Church Logic, arithmetic, and automata Proceedings of the International Congress of Mathematicians 1962 Institut Mittag-Leffler 23 35
29. A. Condon The complexity of stochastic games Inform. and Comput. 96 2 1992 203 224
30. A. Condon On algorithms for simple stochastic games Advances in Computational Complexity Theory DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 13 1993 Amer. Math. Soc. 51 73
31. C. Courcoubetis, and M. Yannakakis The complexity of probabilistic verification J. ACM 42 4 1995 857 907
32. L. de Alfaro, Formal verification of probabilistic systems, PhD thesis, Stanford University, 1997.
33. L. de Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, and M. Stoelinga The element of surprise in timed games CONCUR03 Lecture Notes in Comput. Sci. vol. 2761 2003 Springer-Verlag 144 158
34. L. de Alfaro, T.A. Henzinger, Concurrent omega-regular games, in: LICS00, IEEE, 2000, pp. 141-154.
35. L. de Alfaro, and T.A. Henzinger Interface automata FSE01 2001 ACM Press 109 120 (Pubitemid 35466916)
36. L. de Alfaro, and T.A. Henzinger Interface theories for component-based design EMSOFT01 Lecture Notes in Comput. Sci. vol. 2211 2001 Springer 148 165 (Pubitemid 33351856)
37. L. de Alfaro, T.A. Henzinger, O. Kupferman, Concurrent reachability games, in: FOCS98, IEEE, 1998, pp. 564-575.
38. L. de Alfaro, T.A. Henzinger, and R. Majumdar Discounting the future in systems theory ICALP03 Lecture Notes in Comput. Sci. vol. 2719 2003 Springer 1022 1037
39. L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang The control of synchronous systems CONCUR00 Lecture Notes in Comput. Sci. vol. 1877 2000 Springer 458 473
40. L. de Alfaro, T.A. Henzinger, F.Y.C. Mang, Detecting errors before reaching them, in: CAV00, 2000, pp. 186-201.
41. L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang The control of synchronous systems, part ii CONCUR01 Lecture Notes in Comput. Sci. vol. 2154 2001 Springer 566 580
42. L. de Alfaro, and R. Majumdar Quantitative solution of omega-regular games STOC01 2001 ACM Press 675 683 (Pubitemid 32865785)
43. L. de Alfaro, R. Majumdar, M. Stoelinga, V. Raman, Game relations and metrics, in: LICS07, IEEE, 2007, pp. 99-108.
44. D.L. Dill Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits 1989 The MIT Press
45. S. Dziembowski, M. Jurdziński, I. Walukiewicz, How much memory is needed to win infinite games? in: LICS97, IEEE, 1997, pp. 99-110.
46. A. Ehrenfeucht, and J. Mycielski Positional strategies for mean payoff games Internat. J. Game Theory 8 2 1979 109 113
47. E.A. Emerson, C. Jutla, The complexity of tree automata and logics of programs, in: FOCS88, IEEE, 1988, pp. 328-337.
48. E.A. Emerson, C. Jutla, Tree automata, mu-calculus and determinacy, in: FOCS91, IEEE, 1991, pp. 368-377.
49. K. Etessami, and M. Yannakakis Recursive Markov decision processes and recursive stochastic games ICALP05 Lecture Notes in Comput. Sci. vol. 3580 2005 Springer 891 903 (Pubitemid 41436155)
50. K. Etessami, and M. Yannakakis Recursive concurrent stochastic games ICALP06 (2) Lecture Notes in Comput. Sci. vol. 4052 2006 Springer 324 335 (Pubitemid 44113258)
51. H. Everett Recursive games Contributions to the Theory of Games III Ann. of Math. Stud. vol. 39 1957 47 78
52. J. Filar, and K. Vrieze Competitive Markov Decision Processes 1997 Springer-Verlag
53. Y. Gurevich, and L. Harrington Trees, automata, and games STOC82 1982 ACM Press 60 65
54. T.A. Henzinger, R. Jhala, and R. Majumdar Counterexample-guided control ICALP03 Lecture Notes in Comput. Sci. vol. 2719 2003 Springer 886 902
55. T.A. Henzinger, S.C. Krishnan, O. Kupferman, and F.Y.C. Mang Synthesis of uninitialized systems ICALP02 Lecture Notes in Comput. Sci. vol. 2380 2002 Springer 644 656
56. T.A. Henzinger, O. Kupferman, and S. Rajamani Fair simulation Inform. and Comput. 173 2002 64 81
57. T.A. Henzinger, R. Majumdar, F.Y.C. Mang, and J.-F. Raskin Abstract interpretation of game properties SAS00 Lecture Notes in Comput. Sci. vol. 1824 2000 Springer 220 239
58. F. Horn, Streett games on finite graphs, in: GDV05, 2005.
59. P. Hunter, A. Dawar, Complexity bounds for regular games, in: MFCS05, 2005, pp. 495-506. (Pubitemid 41449524)
60. N. Immerman Number of quantifiers is better than number of tape cells J. Comput. System Sci. 22 1981 384 406
61. J.F. Nash Jr. Equilibrium points in n-person games Proc. Natl. Acad. Sci. USA 36 1950 48 49
62. M. Jurdziński Deciding the winner in parity games is in UP co-UP Inform. Process. Lett. 68 3 1998 119 124 (Pubitemid 128379407)
63. M. Jurdziński Small progress measures for solving parity games STACS00 Lecture Notes in Comput. Sci. vol. 1770 2000 Springer 290 301
64. M. Jurdziński, M. Paterson, and U. Zwick A deterministic subexponential algorithm for solving parity games SODA06 2006 ACM-SIAM 117 123 (Pubitemid 43275231)
65. D. Kozen Results on the propositional μ-calculus Theoret. Comput. Sci. 27 3 1983 333 354
66. O. Kupferman, and M.Y. Vardi Weak alternating automata and tree automata emptiness STOC98 1998 ACM Press 224 233
67. W. Ludwig A subexponential randomized algorithm for the simple stochastic game problem Inform. and Comput. 117 1995 151 155
68. O. Maler, A. Pnueli, and J. Sifakis On the synthesis of discrete controllers for timed systems STACS95 Lecture Notes in Comput. Sci. vol. 900 1995 Springer 229 242
69. Z. Manna, and A. Pnueli The Temporal Logic of Reactive and Concurrent Systems: Specification 1992 Springer-Verlag
70. D.A. Martin Borel determinacy Ann. of Math. 102 2 1975 363 371
71. D.A. Martin The determinacy of Blackwell games J. Symbolic Logic 63 4 1998 1565 1581 (Pubitemid 128338401)
72. A. McIver, and C. Morgan Games, probability, and the quantitative μ-calculus qμ LPAR02 Lecture Notes in Comput. Sci. vol. 2514 2002 Springer 292 310
73. R. McNaughton Infinite games played on finite graphs Ann. Pure Appl. Logic 65 1993 149 184
74. J.F. Mertens, and A. Neyman Stochastic games Internat. J. Game Theory 10 1981 53 66
75. A.W. Mostowski Regular expressions for infinite trees and a standard form of automata 5th Symposium on Computation Theory Lecture Notes in Comput. Sci. vol. 208 1984 Springer 157 168
76. G. Owen Game Theory 1995 Academic Press
77. C.H. Papadimitriou, and J.N. Tsitsiklis The complexity of Markov decision processes Math. Oper. Res. 12 1987 441 450
78. N. Piterman, A. Pnueli, Faster solution of Rabin and Streett games, in: LICS06, IEEE, 2006, pp. 275-284. (Pubitemid 47130373)
79. A. Pnueli, and R. Rosner On the synthesis of a reactive module POPL89 1989 ACM Press 179 190
80. A. Puri, Theory of hybrid systems and discrete event systems, PhD thesis, University of California, Berkeley, 1995.
81. M.O. Rabin Automata on Infinite Objects and Churchs Problem Conference Ser. Math. vol. 13 1969 Amer. Math. Soc.
82. P.J. Ramadge, and W.M. Wonham Supervisory control of a class of discrete-event processes SIAM J. Control Optim. 25 1 1987 206 230 (Pubitemid 17513624)
83. J.H. Reif Universal games of incomplete information STOC79 1979 ACM Press 288 308
84. P. Secchi, and W.D. Sudderth Stay-in-a-set games Internat. J. Game Theory 30 2001 479 490 (Pubitemid 33406283)
85. L.S. Shapley Stochastic games Proc. Natl. Acad. Sci. USA 39 1953 1095 1100
86. W. Thomas On the synthesis of strategies in infinite games STACS95 Lecture Notes in Comput. Sci. vol. 900 1995 Springer 1 13
87. W. Thomas Languages, automata, and logic G. Rozenberg, A. Salomaa, Handbook of Formal Languages vol. 3 1997 Beyond Words, Springer 389 455 (Chapter 7)
88. M.Y. Vardi Automatic verification of probabilistic concurrent finite-state systems FOCS85 1985 IEEE Computer Society Press 327 338
89. N. Vieille Two player stochastic games I: A reduction Israel J. Math. 119 2000 55 91
90. N. Vieille Two player stochastic games II: The case of recursive games Israel J. Math. 119 2000 93 126
91. J. Vöge, and M. Jurdziński A discrete strategy improvement algorithm for solving parity games CAV00 Lecture Notes in Comput. Sci. vol. 1855 2000 Springer 202 215
92. I. Walukiewicz Pushdown processes: Games and model checking CAV96 Lecture Notes in Comput. Sci. vol. 1102 1996 Springer 62 74 (Pubitemid 126101270)
93. I. Walukiewicz, A landscape with games in the background, in: LICS04, IEEE, 2004, pp. 356-366.
94. W. Zielonka Perfect-information stochastic parity games FoSSaCS04 Lecture Notes in Comput. Sci. vol. 2987 2004 Springer 499 513
95. W. Zielonka Infinite games on finitely coloured graphs with applications to automata on infinite trees Theoret. Comput. Sci. 200 1-2 1998 135 183 (Pubitemid 128450815)
96. U. Zwick, and M. Paterson The complexity of mean payoff games on graphs Theoret. Comput. Sci. 158 1996 343 359 (Pubitemid 126411935)