Assume-Admissible Synthesis

TL;DR

This paper presents a new synthesis rule for reactive systems based on admissible strategies, resulting in robust, rectangular solution sets with optimal algorithms and an abstraction framework.

Contribution

It introduces a novel synthesis rule using admissible strategies that ensures rectangular, robust solutions, improving upon previous methods.

Findings

Solutions are rectangular and resilient.

Algorithms with optimal complexity are provided.

An abstraction framework is developed.

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. 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.