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 model-checking problem under admissibility and the assume-admissible synthesis problem for real-time non-zero sum n-player games for safety objectives.
Type de document :
Communication dans un congrès
Models, Algorithms, Logics and Tools., Jul 2017, Aalborg, Denmark. Springer International Publishing, 10460, pp.403-425, 2017, Lecture Notes in Computer Science
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01515874
Contributeur : Ocan Sankur <>
Soumis le : vendredi 28 avril 2017 - 11:25:54
Dernière modification le : jeudi 7 février 2019 - 14:33:34
Document(s) archivé(s) le : samedi 29 juillet 2017 - 13:02:07

Fichiers

kim (1).pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01515874, version 1

Citation

Nicolas Basset, Jean-François Raskin, Ocan Sankur. Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools., Jul 2017, Aalborg, Denmark. Springer International Publishing, 10460, pp.403-425, 2017, Lecture Notes in Computer Science. 〈hal-01515874〉

Partager

Métriques

Consultations de la notice

354

Téléchargements de fichiers

108