Stochastic Parity Games on Lossy Channel Systems


We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, under the constraint that both players are restricted to finitememory strategies. First, we describe a general framework, where we consider the class of 2 2 -player games with almost-sure parity winning conditions on possibly infinite game… (More)
DOI: 10.1007/978-3-642-40196-1_29


3 Figures and Tables

Slides referencing similar topics