Concurrent reachability games

Theoretical Computer Science

Volumn 386, Issue 3, 2007, Pages 188-217

  de Alfaro, Luca ^a   Henzinger, Thomas A ^b   Kupferman, Orna ^c  

^a University of California Santa Cruz   (United States)

^b EPFL   (Switzerland)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Concurrent games; Games; Reachability; Stochastic games

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBABILITY;

FINITE STATE SPACES; SYSTEM VERIFICATION;

GAME THEORY;

EID: 34848874753     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.008     Document Type: Article

References (48)

1. Alur R., Henzinger T.A., and Kupferman O. Alternating time temporal logic. J. ACM 49 (2002) 672-713
2. 20 states and beyond. Inform. Comput. 95 2 (1992) 142-170
3. Beeri C. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Database Syst. 5 (1980) 241-259
4. Bertsekas D.P. Dynamic Programming and Optimal Control vol. I, II (1995), Athena Scientific
5. Başar T., and Olsder G.J. Dynamic Noncooperative Game Theory (1982), Academic Press
6. Bertsekas D.P., and Tsitsiklis J.N. An analysis of stochastic shortest path problems. Math. Oper. Res. 16 3 (1991) 580-595
7. K. Chatterjee, L. de Alfaro, T.A. Henzinger, The complexity of quantitative concurrent parity games, in: Proc. SODA: ACM-SIAM Symp. Discrete Algorithms, 2006, pp. 678-687
8. K. Chatterjee, L. de Alfaro, T.A. Henzinger, Strategy improvement for concurrent reachability games, in: QEST: IEEE Conf. Quantitative Evaluation of Systems, 2006
9. Chatterjee K., Jurdzinski J., and Henzinger T.A. Simple stochastic parity games. Computer Science Logic. Lect. Notes in Comp. Sci. vol. 2803 (2003), Springer-Verlag 100-113
10. K. Chatterjee, J. Jurdzinski, T.A. Henzinger, Quantitative stochastic parity games, in: Proc. SODA: ACM-SIAM Symp. Discrete Algorithms, 2004, pp. 114-123
11. Condon A. The complexity of stochastic games. Inform. Comput. 96 (1992) 203-224
12. Condon A. On algorithms for simple stochastic games. Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 13 (1993), AMS 51-73
13. Cleaveland R., and Steffen B. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. Computer-Aided Verification. Lect. Notes in Comp. Sci. vol. 575 (1991), Springer-Verlag 48-58
14. C. Courcoubetis, M. Yannakakis, Verifying temporal properties of finite-state probabilistic programs, in: Proc. FOCS: IEEE Symp. Foundations of Computer Science, 1988, pp. 338-354
15. L. de Alfaro, Formal verification of probabilistic systems. Ph.D. Thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601
16. L. de Alfaro, T.A. Henzinger, Concurrent omega-regular games, in: Proc. LICS: IEEE Symp. Logic in Computer Science, 2000, pp. 141-154
17. de Alfaro L., and Majumdar R. Quantitative solution of omega-regular games. J. Comput. Syst. Sci. 68 (2004) 374-397
18. Derman C. Finite-State Markovian Decision Processes (1970), Academic Press
19. E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy (extended abstract), in: Proc. FOCS: IEEE Symp. Foundations of Computer Science, 1991, pp. 368-377
20. Etessami K., and Yannakakis M. Recursive concurrent stochastic games. Int. Coll. Automata, Languages, and Programming. Lect. Notes in Comp. Sci. vol. 4052 (2006), Springer-Verlag 324-335
21. Everett H. Recursive games. Contributions to the Theory of Games III. Ann. Math. Studies vol. 39 (1957) 47-78
22. Filar J.A. Ordered field property for stochastic games when the player who controls transitions changes from state to state. J. Optim. Theory Appl. 34 4 (1981) 503-515
23. Filar J., and Vrieze K. Competitive Markov Decision Processes (1997), Springer-Verlag
24. Hart S., Sharir M., and Pnueli A. Termination of probabilistic concurrent programs. ACM Trans. Prog. Lang. Sys. 5 3 (1983) 356-380
25. Immerman N. Number of quantifiers is better than number of tape cells. J. Comput. System Sci. 22 (1981) 384-406
26. Isaacs R. Differential Games (1965), John Wiley
27. Jurdziński M., Kupferman O., and Henzinger T.A. Trading probability for fairness. Computer Science Logic. Lect. Notes in Comp. Sci. vol. 2471 (2002), Springer-Verlag 292-305
28. Jones N.D. Space-bounded reducibility among combinatorial problems. J. Comput. System Sci. 11 (1975) 68-75
29. M. Jurdziński, M. Paterson, U. Zwick, A deterministic subexponential algorithm for solving parity games, in: Proc. SODA: ACM-SIAM Symp. Discrete Algorithms, 2006, pp. 117-123
30. Jurdziński M. Small progress measures for solving parity games. Symp. Theoretical Aspects of Computer Science. Lect. Notes in Comp. Sci. vol. 1770 (2000), Springer-Verlag 290-301
31. Kumar P.R., and Shiau T.H. Existence of value and randomized strategies in zero-sum discrete-time stochastic dynamic games. SIAM J. Control Optim. 19 5 (1981) 617-634
32. Kemeny J.G., Snell J.L., and Knapp A.W. Denumerable Markov Chains (1966), D. Van Nostrand Company
33. Martin D.A. An extension of Borel determinacy. Ann. Pure Appl. Logic 49 (1990) 279-293
34. Martin D.A. The determinacy of Blackwell games. J. Symbolic Logic 63 4 (1998) 1565-1581
35. Osborne M.J., and Rubinstein A. A Course in Game Theory (1994), MIT Press
36. A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. POPL: ACM Symp. Principles of Programming Languages, 1989, pp. 179-190
37. Ramadge P.J.G., and Wonham W.M. The control of discrete event systems. IEEE Trans. Control Theory 77 (1989) 81-98
38. Secchi P. Stationary strategies for recursive games. Math. Oper. Res. 22 2 (1997) 494-512
39. Shapley L.S. Stochastic games. Proc. Natl. Acad. Sci. USA 39 (1953) 1095-1100
40. Thomas W. Automata on infinite objects. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science vol. B (1990), Elsevier Science Publishers 135-191 (Chapter 4)
41. Thomas W. On the synthesis of strategies in infinite games. Symp. Theoretical Aspects of Computer Science. Lect. Notes in Comp. Sci. vol. 900 (1995), Springer-Verlag 1-13
42. Thuijsman F., and Vrieze O.J. The bad match, a total reward stochastic game. OR Spectrum 9 (1987) 93-99
43. M.Y. Vardi, Automatic verification of probabilistic concurrent finite-state systems, in: Proc. FOCS: IEEE Symp. Foundations of Computer Science, 1985, pp. 327-338
44. Vöge J., and Jurdziński M. A discrete strategy-improvement algorithm for solving parity games. Computer-Aided Verification. Lect. Notes in Comp. Sci. vol. 1855 (2000), Springer-Verlag 202-215
45. von Neumann J. Zur Theorie der Gesellschaftsspiele. Math. Ann. 100 (1928) 295-320
46. Vrieze O.J., Tijs S.H., Raghavan T.E.S., and Filar J.A. A finite algorithm for the switching controller stochastic game. OR Spectrum 5 (1983) 15-24
47. M. Yannakakis, Personal communication, 1998
48. Zwick U., and Paterson M. The complexity of mean payoff games on graphs. Theoret. Comput. Sci. 158 (1996) 343-359