-calculus synthesis

DOI10.1007/3-540-44612-5_45MaRDI QIDQ4536385zbMATH OpenFDO

Authors Orna Kupferman, Moshe Y. Vardi

Publication date 4 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_45

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1444727
• Open systems in reactive environments: Control and synthesis
• Church's Problem Revisited
• On high-quality synthesis
• Automated Technology for Verification and Analysis

Cited in

(16)

• Extension of synthesis algorithm of recursive processes to -calculus
• Games for synthesis of controllers with partial observation.
• Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
• Characteristic -calculus formulas for underspecified transition systems
• Minimum Attention Controller Synthesis for Omega-Regular Objectives
• Distributed Synthesis for Alternating-Time Logics
• Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
• Church's Problem Revisited
• scientific article; zbMATH DE number 1444727 (Why is no real title available?)
• Synthesis for multi-weighted games with branching-time winning conditions
• Maximally permissive controlled system synthesis for non-determinism and modal logic
• Symmetric synthesis
• Towards the hierarchical verification of reactive systems
• Specifiable robustness in reactive synthesis
• TSO games -- on the decidability of safety games under the total store order semantics
• Distributed synthesis for well-connected architectures

This page was built for publication: \(\mu\)-calculus synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536385)