Computing adequately permissive assumptions for synthesis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3799616 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A weakness measure for GR(1) formulae
- Assume-Guarantee Synthesis
- Assume-admissible synthesis
- Environment Assumptions for Synthesis
- Information Flow Guided Synthesis
- Obliging games
- Rational synthesis
- Un théorème sur les fonctions d'ensembles.
- Verification, Model Checking, and Abstract Interpretation
Cited in
(5)- With a little help from your friends: semi-cooperative games via joker moves
- Winning strategy templates for stochastic parity games towards permissive and resilient control
- Contract-based distributed logical controller synthesis
- Strategy templates for almost-sure and positive winning of stochastic parity games towards permissive and resilient control
- Synthesizing permissive winning strategy templates for parity games
This page was built for publication: Computing adequately permissive assumptions for synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536127)