Safraless Compositional Synthesis

DOI10.1007/11817963_6zbMath1188.68193OpenAlexW1852279314MaRDI QIDQ5756733

Nir Piterman, Moshe Y. Vardi, Orna Kupferman

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)

Related Items (21)

From LTL to deterministic automata. A safraless compositional approach ⋮ Graph Games and Reactive Synthesis ⋮ Unnamed Item ⋮ Compositional and symbolic synthesis of reactive controllers for multi-agent systems ⋮ Compositional synthesis of modular systems ⋮ Compositional Control Synthesis for Partially Observable Systems ⋮ ATL* Satisfiability Is 2EXPTIME-Complete ⋮ Synthesis of Reactive(1) designs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ Synthesis from component libraries with costs ⋮ Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ From LTL to Symbolically Represented Deterministic Automata ⋮ Prime languages ⋮ Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata ⋮ Computing Weakest Strategies for Safety Games of Imperfect Information ⋮ Practical synthesis of reactive systems from LTL specifications via parity games ⋮ Compositional construction of most general controllers

This page was built for publication: Safraless Compositional Synthesis