Qualitative concurrent stochastic games with imperfect information

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

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 200-211

  Gripon, Vincent ^a   Serre, Olivier ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE RELATIONS; FINAL STATE; FINITE STATE; FOLLOWING PROBLEM; IMPERFECT INFORMATION; REACHABILITY; STOCHASTIC GAME;

LINGUISTICS; PROBABILITY DISTRIBUTIONS; SET THEORY; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TRANSLATION (LANGUAGES);

EQUIVALENCE CLASSES;

EID: 70449122818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_17     Document Type: Conference Paper

References (15)

1. de Alfaro, L., Henzinger, T.A.: Concurrent omega-regular games. In: Proceedings of LICS 2000, pp. 141-154 (2000)
2. de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theoretical Computer Science 386(3), 188-217 (2007)
3. Baier, C., Bertrand, N., Größer, M.: On decision problems for probabilistic büchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 287-301. Springer, Heidelberg (2008)
4. Bertrand, N., Genest, B., Gimbert, H.: Qualitative Determinacy and Decidability of Stochastic Games with Signals. In: Proceedings of LICS 2009 (to appear, 2009)
5. Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., Henzinger, T.A.: Alpaga: A tool for solving parity games with imperfect information. In: TACAS 2009. LNCS, vol. 5505, pp. 58-61. Springer, Heidelberg (2009)
6. Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T.A., Raje, S.: Strategy construction for parity games with imperfect information. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 325-339. Springer, Heidelberg (2008)
7. Chatterjee, K.: Stochastic Ω-Regular Games. PhD thesis, University of California (2007)
8. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science 3(3) (2007)
9. Chatterjee, K., Henzinger, T.A.: Semiperfect-information games. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 1-18. Springer, Heidelberg (2005)
10. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
11. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proceedings of STOC 1982, pp. 60-65 (1982)
12. Horn, F.: Private communication (February 2009)
13. Paz, A.: Introduction to probabilistic automata. Academic Press, New York (1971)
14. Ramadge, P.J., Wonham, W.M.: Supervisory Control of a Class of Discrete Event Processes. SIAM Journal on Control and Optimization 25, 206 (1987)
15. Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences 29(2), 274-301 (1984)