Trading memory for randomness

Proceedings - First International Conference on the Quantitative Evaluation of Systems, QEST 2004

Volumn , Issue , 2004, Pages 206-217

  Chatterjee, Krishnendu ^a   De Alfaro, Luca ^b   Henzinger, Thomas A ^a,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

2-PLAYER GRAPH GAMES; MARKOV DECISION PROCESSES; RANDOMIZATION; STATE BASED SYSTEMS;

AUTOMATA THEORY; FORMAL LANGUAGES; MARKOV PROCESSES; SET THEORY; THEOREM PROVING; USER INTERFACES;

COMPUTER GRAPHICS;

EID: 16244402296     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2004.1348035     Document Type: Conference Paper

References (34)

1. M. Abadi, L. Lamport, and P. Wolper. Relizable and unrelizable concurrent program specifications. In ICALP'89, volume 372 of LNCS, pages 1-17. Springer, 1989.
2. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49:672-713, 2002.
3. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the AMS, 138:295-311, 1969.
4. K. Chatterjee, M. Jurdziński, and T.A. Henzinger. Simple stochastic parity games. In CSL'03, volume 2803 of LNCS, pages 100-113. Springer, 2003.
5. K. Chatterjee, M. Jurdziński, and T.A. Henzinger. Quantitative stochastic parity games. In SODA'04, pages 114-123. SIAM, 2004.
6. A. Church. Logic, arithmetic, and automata. In Proceedings of the International Congress of Mathematicians, pages 23-35. Institut Mittag-Leffler, 1962.
7. A. Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
8. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
9. L. de Alfaro. Temporal logics for the specification of performance and reliability. In STACS'97, volume 1200 of LNCS, pages 165-176. Springer, 1997.
10. L. de Alfaro and T.A. Henzinger. Concurrent ω-regular games. In LICS'00, pages 141-154. IEEE Computer Society, 2000.
11. L. de Alfaro and T.A. Henzinger. Interface automata. In FSE'01, pages 109-120. ACM, 2001.
12. L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. Detecting errors before reaching them. In CAV'00, volume 1855 of LNCS, pages 186-201. Springer, 2000.
13. L. de Alfaro and R. Majumdar. Quantitative solution of ω-regular games. In STOC'01, pages 675-683. ACM, 2001.
14. D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.
15. S. Dziembowski, M. Jurdziński, and I. Walukiewicz. How much memory is needed to win infinite games? In LICS'97, pages 99-110. IEEE Computer Society, 1997.
16. E.A. Emerson and C. Jutla. Tree automata, μ-calculus, and determinacy. In FOCS'91, pages 368-377. IEEE Computer Society, 1991.
17. H. Everett. Recursive games. In Contributions to the Theory of Games III, volume 39 of Annals of Mathematical Studies, pages 47-78. Princeton University Press, 1957.
18. J.A. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
19. Y. Gurevich and L. Harrington. Trees, automata, and games. In STOC'82, pages 60-65. ACM, 1982.
20. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. Information and Computation, 173:64-81, 2002.
21. A. Kechris. Classical Descriptive Set Theory. Springer, 1995.
22. J.H. Kemeny. Finite Markov Chains. Springer, 1983.
23. B. Khoussainov and A. Nerode. Automata Theory and its Applications. Birkhäuser, 2001.
24. D.A. Martin. The determinacy of Blackwell games. Journal of Symbolic Logic, 63:1565-1581, 1998.
25. D.A. Martin. Borel determinacy. Annals of Mathematics, 102:363-371, 1975.
26. A.K. McIver and C.C. Morgan. Games, probability, and the quantitative μ-calculus. In LPAR'02, volume 2514 of LNAI, pages 292-310. Springer, 2002.
27. R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149-184, 1993.
28. A.W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Computation Theory, volume 208 of LNCS, pages 157-168. Springer, 1984.
29. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL'89, pages 179-190. ACM, 1989.
30. T.E.S. Raghavan and J.A. Filar. Algorithms for stochastic games: a survey. ZOR - Methods and Models of Operations Research, 35:437-472, 1991.
31. P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization, 25:206-230, 1987.
32. W. Thomas. On the synthesis of strategies in infinite games. In STACS'95, volume 900 of LNCS, pages 1-13. Springer, 1995.
33. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 389-455. Springer, 1997.
34. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1-37, 1994.