Solving Stochastic B\"uchi Games on Infinite Arenas with a Finite Attractor
Logic in Computer Science
2013-06-13 v4 Formal Languages and Automata Theory
Computer Science and Game Theory
Abstract
We consider games played on an infinite probabilistic arena where the first player aims at satisfying generalized B\"uchi objectives almost surely, i.e., with probability one. We provide a fixpoint characterization of the winning sets and associated winning strategies in the case where the arena satisfies the finite-attractor property. From this we directly deduce the decidability of these games on probabilistic lossy channel systems.
Keywords
Cite
@article{arxiv.1207.4577,
title = {Solving Stochastic B\"uchi Games on Infinite Arenas with a Finite Attractor},
author = {Nathalie Bertrand and Philippe Schnoebelen},
journal= {arXiv preprint arXiv:1207.4577},
year = {2013}
}
Comments
In Proceedings QAPL 2013, arXiv:1306.2413