Assume-Guarantee Synthesis

DOI10.1007/978-3-540-71209-1_21MaRDI QIDQ5758113zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Thomas A. Henzinger

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_21

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)

Recommendations

• Cooperative reactive synthesis
• Assume-guarantee synthesis for digital contract signing
• Synthesis of Reactive(1) designs
• Rational synthesis
• Assume-admissible synthesis

Cited in

(34)

• Compositional strategy synthesis for stochastic games with multiple objectives
• Distributed synthesis for parameterized temporal logics
• Strategy construction for parity games with imperfect information
• Compositional synthesis of modular systems
• Quantitative assume guarantee synthesis
• On the relation between reactive synthesis and supervisory control of non-terminating processes
• On the existence of weak subgame perfect equilibria
• Synthesizing protocols for digital contract signing
• On the existence of weak subgame perfect equilibria
• Graph Games and Reactive Synthesis
• Compositional Control Synthesis for Partially Observable Systems
• Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
• Cooperative reactive synthesis
• Rational synthesis
• The complexity of rational synthesis
• Pattern-based refinement of assume-guarantee specifications in reactive synthesis
• Assume-guarantee synthesis for concurrent reactive programs with partial information
• On the hardness of priority synthesis
• Assume-admissible synthesis
• Coherent minimisation: towards efficient tamper-proof compilation
• Assume-admissible synthesis
• Automated Technology for Verification and Analysis
• Synthesizing Computable Functions from Rational Specifications Over Infinite Words
• Information Flow Guided Synthesis
• Stackelberg-Pareto synthesis
• With a little help from your friends: semi-cooperative games via joker moves
• Computing adequately permissive assumptions for synthesis
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• Contract-based distributed logical controller synthesis
• With a little help from your friends: semi-cooperative games via joker moves
• The non-cooperative rational synthesis problem for SPEs and -regular objectives
• Contract-based multi-agent logical controller synthesis under uncertainty
• Assume-guarantee synthesis for digital contract signing
• Strategy logic

This page was built for publication: Assume-Guarantee Synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758113)