Optimal strategy synthesis for request-response games∗
1 LIAFA, Université Denis Diderot -
Paris 7, 75205
Paris cedex 13,
2 Lehrstuhl für Informatik 7, RWTH Aachen University, 52056 Aachen, Germany.
3 Reactive Systems Group, Saarland University, 66123 Saarbrücken, Germany.
Accepted: 3 August 2015
We show the existence and effective computability of optimal (even finite-state) 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.
Mathematics Subject Classification: 68Q45
Key words: Request-response games / optimal strategies / mean-payoff games
© EDP Sciences 2015