Evènement pour le groupe Modélisation et Verification

Date 2010-07-01  11:30-12:45
TitreSolving Simple Stochastic Tail Games 
RésuméStochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environnment. The evolution of the system depends on the decisions of the players, supplemented by random transitions. There are two main algorithmic problems on such games: computing the values (quantitative analysis) and deciding whether a player can win with probability 1 (qualitative analysis). In this paper we reduce the quantitative analysis to the qualitative analysis: we provide an algorithm for computing values which uses qualitative analysis as a sub- procedure. The correctness proof of this algorithm reveals several nice properties of perfect-information stochastic tail games, in particular the existence of optimal strategies. We apply these results to games whose winning conditions are boolean combinations of mean-payoff and Buchi conditions. 
LieuSalle 076, LaBRI, Rez-de-chaussée 
OrateurFlorian Horn 
UrlLIAFA (Paris) 

Aucun document lié à cet événement.

Retour à l'index