License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2015.100
URN: urn:nbn:de:0030-drops-53711
Go to the corresponding LIPIcs Volume Portal

Brenguier, Romain ; Raskin, Jean-Fran├žois ; Sankur, Ocan

Assume-Admissible Synthesis

11.pdf (0.5 MB)


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. It is based on the notion of admissible strategies. We compare our novel rule with previous rules defined in the literature, and we show that contrary to the previous proposals, our rule define sets of solutions which are rectangular. This property leads to solutions which are robust and resilient. We provide algorithms with optimal complexity and also an abstraction framework.

BibTeX - Entry

  author =	{Romain Brenguier and Jean-Fran{\c{c}}ois Raskin and Ocan Sankur},
  title =	{{Assume-Admissible Synthesis}},
  booktitle =	{26th International Conference on Concurrency Theory (CONCUR 2015)},
  pages =	{100--113},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-91-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{42},
  editor =	{Luca Aceto and David de Frutos Escrig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-53711},
  doi =		{10.4230/LIPIcs.CONCUR.2015.100},
  annote =	{Keywords: Multi-player games, controller synthesis, admissibility}

Keywords: Multi-player games, controller synthesis, admissibility
Collection: 26th International Conference on Concurrency Theory (CONCUR 2015)
Issue Date: 2015
Date of publication: 26.08.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI