Admissible Strategies in Timed Games

Nicolas Basset (1) , Jean-François Raskin (1) , Ocan Sankur (2, 3)

1 ULB - Université libre de Bruxelles
2 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires
3 SUMO - SUpervision of large MOdular and distributed systems

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.

Domaines: Informatique et théorie des jeux [cs.GT]

Nicolas Basset, Jean-François Raskin, Ocan Sankur. Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools., Jul 2017, Aalborg, Denmark. pp.403-425. ⟨hal-01515874⟩