Safraless Compositional Synthesis
From MaRDI portal
Recommendations
Cited in
(29)- Compositional Control Synthesis for Partially Observable Systems
- Synthesis from component libraries with costs
- From LTL to Symbolically Represented Deterministic Automata
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
- ATL* Satisfiability Is 2EXPTIME-Complete
- Practical synthesis of reactive systems from LTL specifications via parity games
- scientific article; zbMATH DE number 2104638 (Why is no real title available?)
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- Compositional construction of most general controllers
- Prime languages
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- Computing Weakest Strategies for Safety Games of Imperfect Information
- Compositional and symbolic synthesis of reactive controllers for multi-agent systems
- Efficient reactive synthesis using mode decomposition
- Dependency-Based Compositional Synthesis
- Antichains and compositional algorithms for LTL synthesis
- LTL to deterministic Emerson-Lei automata
- Perpetuality for Full and Safe Composition (in a Constructive Setting)
- Synthesis of Reactive(1) designs
- Towards the exact complexity of realizability for safety LTL
- From Monadic Logic to PSL
- Graph Games and Reactive Synthesis
- Safraless LTL synthesis considering maximal realizability
- From Philosophical to Industrial Logics
- Compositional algorithms for LTL synthesis
- Information Flow Guided Synthesis
- Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
- From LTL to deterministic automata. A safraless compositional approach
- Compositional synthesis of modular systems
This page was built for publication: Safraless Compositional Synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756733)
