Admissible Strategies in Timed GamesReport as inadecuate

Admissible Strategies in Timed Games - Download this document for free, or read online. Document in PDF available to download.

1 ULB - Université Libre de Bruxelles Bruxelles 2 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires 3 SUMO - SUpervision of large MOdular and distributed systems Inria Rennes – Bretagne Atlantique , IRISA D4 - LANGAGE ET GÉNIE LOGICIEL

Abstract : In this paper, we study the notion of admissibility in timed games. First, we show that admissible strategies may not exist in timed games with a continuous semantics of time, even for safety objectives. Second, we show that the discrete time semantics of timed games is better behaved w.r.t. admissibility: the existence of admissible strategies is guaranteed in that semantics. Third, we provide symbolic algorithms to solve the model-checking problem under admissibility and the assume-admissible synthesis problem for real-time non-zero sum n-player games for safety objectives.

Author: Nicolas Basset - Jean-François Raskin - Ocan Sankur -



Related documents