Assume-admissible synthesis

DOI10.1007/s00236-016-0273-2zbMath1362.68202arXiv1507.00623OpenAlexW853304191MaRDI QIDQ520340

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

Publication date: 3 April 2017

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

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

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)

Related Items (12)

Active learning of sequential transducers with side information about the domain ⋮ Compositional synthesis of modular systems ⋮ On the relation between reactive synthesis and supervisory control of non-terminating processes ⋮ Dependences in Strategy Logic ⋮ Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ Synthesizing Computable Functions from Rational Specifications Over Infinite Words ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Existence of Weak Subgame Perfect Equilibria ⋮ Dependences in strategy logic ⋮ Unnamed Item ⋮ A game-theoretic approach for the synthesis of complex systems

Cites Work

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

This page was built for publication: Assume-admissible synthesis