Stochastic Parity Games on Lossy Channel Systems
Abstract
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general framework, where we consider the class of 2 1/2-player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contains a {\it finite attractor}. An attractor is a set of states (not necessarily absorbing) that is almost surely re-visited regardless of the players' decisions. We present a scheme that characterizes the set of winning states for each player. Then, we instantiate this scheme to obtain an algorithm for {\it stochastic game lossy channel systems}.
Keywords
Cite
@article{arxiv.1410.4448,
title = {Stochastic Parity Games on Lossy Channel Systems},
author = {Parosh Aziz Abdulla and Lorenzo Clemente and Richard Mayr and Sven Sandberg},
journal= {arXiv preprint arXiv:1410.4448},
year = {2019}
}
Comments
QEST'13 special issue, to appear in Logical Methods in Computer Science (LMCS-2014-964). arXiv admin note: substantial text overlap with arXiv:1305.5228