| | |
Summary: Stochastic Games with Lossy Channels
Parosh Aziz Abdulla1
, Noomene Ben Henda1
, Luca de Alfaro2
,
Richard Mayr3
, and Sven Sandberg1
1
Uppsala University, Sweden
2
University of California, Santa Cruz, USA
3
NC State University, USA
Abstract. 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 Bšuchi (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.
|
