Assume-admissible synthesis - IMT - Institut Mines-Télécom Accéder directement au contenu
Article Dans Une Revue Acta Informatica Année : 2016

Assume-admissible synthesis

Résumé

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.
Fichier principal
Vignette du fichier
aa.pdf (717.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01373538 , version 1 (28-09-2016)

Identifiants

Citer

Romain Brenguier, Jean-François Raskin, Ocan Sankur. Assume-admissible synthesis. Acta Informatica, 2016, ⟨10.1007/s00236-016-0273-2⟩. ⟨hal-01373538⟩
249 Consultations
168 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More