Stochastic games with lossy channels

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

Volumn 4962 LNCS, Issue , 2008, Pages 35-49

  Abdulla, Parosh Aziz ^a   Ben Henda, Noomene ^a   De Alfaro, Luca ^b   Mayr, Richard ^c   Sandberg, Sven ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; FOUNDATIONS; PROBABILITY; STOCHASTIC PROGRAMMING;

COMPUTATIONAL STRUCTURES; EUROPEAN; HEIDELBERG (CO); INFINITE GRAPHS; INTERNATIONAL (CO); LOSSY CHANNELS; MARKOV DECISION PROCESS (MDP); PROBABILISTIC LOSSY CHANNEL SYSTEMS; PROBABILISTIC LOSSY CHANNEL SYSTEMS (PLCS); REACH ABILITY; SOFTWARE SCIENCE; STOCHASTIC GAMES; SYMBOLIC REPRESENTATIONS; WINNING CONDITIONS;

GAME THEORY;

EID: 47249129505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_4     Document Type: Conference Paper

References (28)

1. Abdulla, P.A., Baier, C., Iyer, P., Jonsson, B.: Reasoning about probabilistic lossy channel systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 320-333. Springer, Heidelberg (2000)
2. Abdulla, P.A., Ben Henda, N., Mayr, R., Sandberg, S., de Alfaro, L.: Stochastic games with lossy channels. Technical Report 2007-005, Dept. of Information Technology, Uppsala University, Sweden (February 2007)
3. Abdulla, P.A., Bouajjani, A., d'Orso, J.: Deciding monotonic games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 1-14. Springer, Heidelberg (2003)
4. st IEEE Int. Symp. on Logic in Computer Science, pp. 127-136 (2005)
5. Abdulla, P.A., Henda, N.B., Mayr, R., Sandberg, S.: Eager Markov chains. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 24-38. Springer, Heidelberg (2006)
6. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91-101 (1996)
7. Abdulla, P.A., Rabinovich, A.: Verification of probabilistic systems with faulty communication. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 39-53. Springer, Heidelberg (2003)
8. Asarin, E., Collins, P.: Noisy Turing machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1031-1042. Springer, Heidelberg (2005)
9. Baier, C., Bertrand, N., Schnoebelen, P.: On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 347-361. Springer, Heidelberg (2006)
10. Baier, C., Bertrand, N., Schnoebelen, P.: Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Comp. Logic (to appear, 2006)
11. Bertrand, N., Schnoebelen, P.: Model checking lossy channels systems is probably decidable. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 120-135. Springer, Heidelberg (2003)
12. Chatterjee, K., Jurdziński, M., Henzinger, T.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 100-113. Springer, Heidelberg (2003)
13. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
14. Condon, A.: The complexity of stochastic games. Information and Computation 96(2), 203-224 (1992)
15. th IEEE Int. Symp. on Logic in Computer Science, pp. 141-156. IEEE Computer Society Press, Los Alamitos (2000)
16. th Annual Symp. Foundations of Computer Science, pp. 564-575. IEEE Computer Society Press, Los Alamitos (1998)
17. de Alfaro, L., Henzinger, T., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 536-550. Springer, Heidelberg (2001)
18. th IEEE Int. Symp. on Logic in Computer Science, pp. 12-21 (2004)
19. Etessami, K., Yannakakis, M.: Recursive Markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 891-903. Springer, Heidelberg (2005)
20. Finkel, A.: Decidability of the termination problem for completely specified protocols. Distributed Computing 7(3), 129-135 (1994)
21. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3) 2(7), 326-336 (1952)
22. Iyer, P., Narasimha, M.: Probabilistic lossy channel systems. In: Bidoit, M., Dauchet, M. (eds.) TAPSOFT 1997. LNCS, vol. 1214, pp. 667-681. Springer, Heidelberg (1997)
23. Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains. D Van Nostad Co. (1966)
24. Rabinovich, A.: Quantitative analysis of probabilistic lossy channel systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1008-1021. Springer, Heidelberg (2003)
25. Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251-261 (2002)
26. Shapley, L.S.: Stochastic games. Proceedings of the National Academy of Sciences 39(10), 1095-1100 (1953)
27. th Annual Symp. Foundations of Computer Science, pp. 327-338 (1985)
28. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 135-183 (1998)