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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1617325 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3767031 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- Admissibility in Games
- Admissibility in Infinite Games
- Admissible Strategies in Infinite Games over Graphs
- An improved algorithm for the evaluation of fixpoint expressions
- Assume-Guarantee Synthesis
- Assume-admissible synthesis
- Down the Borel hierarchy: solving Muller games via safety games
- Environment Assumptions for Synthesis
- Equilibrium points in n -person games
- Fast and simple nested fixpoints
- Game Theory in Wireless and Communication Networks
- Game theory
- Games with secure equilibria
- Grammar Analysis and Parsing by Abstract Interpretation
- Mathematical Foundations of Computer Science 2005
- Permissive strategies: from parity games to safety games
- Rational synthesis
- Reasoning about strategies
- Strategy logic
- Synthesis with rational environments
- The complexity of admissibility in omega-regular games
Cited in
(16)- Dependences in strategy logic
- scientific article; zbMATH DE number 7447732 (Why is no real title available?)
- Dependences in strategy logic
- A game-theoretic approach for the synthesis of complex systems
- Active learning of sequential transducers with side information about the domain
- On the relation between reactive synthesis and supervisory control of non-terminating processes
- On the existence of weak subgame perfect equilibria
- Assume-admissible synthesis
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Adapting to the behavior of environments with bounded memory
- scientific article; zbMATH DE number 7447731 (Why is no real title available?)
- Compositional synthesis of modular systems
- Computing adequately permissive assumptions for synthesis
- Assume-Guarantee Synthesis
- scientific article; zbMATH DE number 7533335 (Why is no real title available?)
This page was built for publication: Assume-admissible synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520340)
