Evènement pour le groupe Modélisation et Verification

Date 2010-10-14  11:30-12:45
TitreExpected Reachability-Time Games 
RésuméIn an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. We show that ERTGs are positionally determined. Using the boundary region graph abstraction, and a generalisation of Asarin and Maler’s simple function, we show that the decision problems related to computing the value of ERTGs are decidable and their complexity is in NEXPTIME ∩ co-NEXPTIME. 
LieuSalle 178, LaBRI 
OrateurAshutosh Trivedi 
UrlThe University of Warwick, UK 

Aucun document lié à cet événement.

Retour à l'index