Optimal Strategy Synthesis for Request-Response Games
arXiv:1406.4648
Abstract
We show the existence and effective computability of optimal winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.
The present paper is a revised version with simplified proofs of results announced in the conference paper of the same name presented at ATVA 2008, which in turn extended results of the third author's dissertation