Assume-admissible synthesis

DOI10.1007/S00236-016-0273-2zbMATH Open1362.68202arXiv1507.00623OpenAlexW853304191MaRDI QIDQ520340FDOQ520340

Authors: Romain Brenguier, Jean-François Raskin, Ocan Sankur 

Publication date: 3 April 2017

Published in: Acta Informatica (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1507.00623

Recommendations

• Assume-admissible synthesis
• Assume-Guarantee Synthesis
• Rational synthesis
• Automated Technology for Verification and Analysis
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Equilibrium points in n -person games
• Game theory
• Title not available (Why is that?)
• Admissibility in Games
• Mathematical Foundations of Computer Science 2005
• Title not available (Why is that?)
• Grammar Analysis and Parsing by Abstract Interpretation
• Game Theory in Wireless and Communication Networks
• Reasoning about strategies
• Synthesis with rational environments
• Environment Assumptions for Synthesis
• Rational synthesis
• Assume-admissible synthesis
• An improved algorithm for the evaluation of fixpoint expressions
• Games with secure equilibria
• Strategy logic
• Fast and simple nested fixpoints
• Title not available (Why is that?)
• Down the Borel hierarchy: solving Muller games via safety games
• Permissive strategies: from parity games to safety games
• Admissible Strategies in Infinite Games over Graphs
• Admissibility in Infinite Games
• Title not available (Why is that?)
• The complexity of admissibility in omega-regular games
• Assume-Guarantee Synthesis

Cited In (16)

• Title not available (Why is that?)
• Dependences in strategy logic
• 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
• Title not available (Why is that?)
• Compositional synthesis of modular systems
• Computing adequately permissive assumptions for synthesis
• Assume-Guarantee Synthesis
• Title not available (Why is that?)

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)