Stochastic games with lossy channels
2008 (English)In: Foundations of Software Science and Computational Structures: Proceedings / [ed] Amadio R, Berlin: Springer-Verlag , 2008, 35-49 p.Conference paper (Refereed)
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLCS). We study games with Buchi (repeated reachability) objectives and almost-sure winning conditions. These games are pure memoryless determined and, under the assumption that the target set is regular, a symbolic representation of the set of winning states for each player can be effectively constructed. Thus, turn-based stochastic games on GPLCS are decidable. This generalizes the decidability result for PLCS-induced Markov decision processes in .
Place, publisher, year, edition, pages
Berlin: Springer-Verlag , 2008. 35-49 p.
, Lecture Notes in Computer Science, 4962
IdentifiersURN: urn:nbn:se:uu:diva-106057DOI: 10.1007/978-3-540-78499-9_4ISI: 000254606200004OAI: oai:DiVA.org:uu-106057DiVA: diva2:223659
11th International Conference on Foundations of Software Science and Computational Structures Budapest, HUNGARY, MAR 29-APR 06, 2008