Safraless Compositional Synthesis

DOI10.1007/11817963_6MaRDI QIDQ5756733zbMATH OpenOpenAlexFDO

Authors Orna Kupferman, Nir Piterman, Moshe Y. Vardi

Publication date 5 September 2007

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817963_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Compositional algorithms for LTL synthesis
• scientific article; zbMATH DE number 2104638
• scientific article; zbMATH DE number 7311251
• Synthesis from Component Libraries
• Bounded Synthesis

Cited in

(32)

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

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)