Safraless Compositional Synthesis

DOI10.1007/11817963_6zbMATH Open1188.68193OpenAlexW1852279314MaRDI QIDQ5756733FDOQ5756733

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (29)

• Compositional Control Synthesis for Partially Observable Systems
• From LTL to Symbolically Represented Deterministic Automata
• Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
• ATL* Satisfiability Is 2EXPTIME-Complete
• Synthesis from component libraries with costs
• Practical synthesis of reactive systems from LTL specifications via parity games
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Efficient reactive synthesis using mode decomposition
• Dependency-Based Compositional Synthesis
• Compositional and symbolic synthesis of reactive controllers for multi-agent systems
• LTL to deterministic Emerson-Lei automata
• Perpetuality for Full and Safe Composition (in a Constructive Setting)
• Antichains and compositional algorithms for LTL synthesis
• Towards the exact complexity of realizability for safety LTL
• Synthesis of Reactive(1) designs
• From Monadic Logic to PSL
• Graph Games and Reactive Synthesis
• Safraless LTL synthesis considering maximal realizability
• From Philosophical to Industrial Logics
• Information Flow Guided Synthesis
• Compositional algorithms for LTL 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)