Admissible Strategies in Timed Games

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 modelchecking problem under admissibility and the assume-admissible synthesis problem for real-time non-zero sum n-player games for safety objectives.

Parameterized Games and Parameterized Automata

“…The investigation of dominance and admissibility in games played on finite graphs was initiated in [5] and subsequently became an active research topic (e.g. [12,10,2,8,4]). A central result in [5] is that for boolean objectives (i.e.…”