Assume-admissible synthesis

Abstract : In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. This rule is based on the notion of admissible strategies. We compare this rule with previous rules defined in the literature, and show that contrary to the previous proposals, it defines sets of solutions which are rectangular. This property leads to solutions which are robust and resilient, and allows one to synthesize strategies separately for each agent. We provide algorithms with optimal complexity and also an abstraction framework compatible with the new rule.
Type de document :
Article dans une revue
Acta Informatica, Springer Verlag, 2016, 〈10.1007/s00236-016-0273-2〉
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger
Contributeur : Ocan Sankur <>
Soumis le : mercredi 28 septembre 2016 - 22:26:27
Dernière modification le : vendredi 11 janvier 2019 - 13:53:31


Fichiers produits par l'(les) auteur(s)



Romain Brenguier, Jean-François Raskin, Ocan Sankur. Assume-admissible synthesis. Acta Informatica, Springer Verlag, 2016, 〈10.1007/s00236-016-0273-2〉. 〈hal-01373538〉



Consultations de la notice


Téléchargements de fichiers