Assume-Admissible Synthesis
Not on the map. Why?
Abstract (arXiv)
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 defines 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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Jul 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.
- 2023Auction-Based Schedulingcited by 1
- 2021Active Learning of Sequential Transducers with Side Information about the Domaincited by 0
- 2023Auction-Based Scheduling18 Oct 2023
- 2021Active Learning of Sequential Transducers with Side Information about the Domain23 Apr 2021