Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
From MaRDI portal
Recommendations
Cites work
- -calculus synthesis
- A decidable class of asynchronous distributed controllers
- Church's Problem Revisited
- Distributed controller synthesis for local specifications
- Distributed games with causal memory are decidable for series-parallel systems
- Distributed Synthesis for Well-Connected Architectures
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- Local temporal logic is expressively complete for cograph dependence alphabets
- Open systems in reactive environments: Control and synthesis
- Synthesis of Asynchronous Systems
Cited in
(10)- Distributed synthesis for regular and contextfree specifications
- Distributed synthesis in continuous time
- Fair synthesis for asynchronous distributed systems
- Distributed synthesis for acyclic architectures
- Distributed synthesis for regular and contextfree specifications
- Synthesis of Asynchronous Systems
- A decidable class of asynchronous distributed controllers
- Distributed Synthesis for Well-Connected Architectures
- On the (High) Undecidability of Distributed Synthesis Problems
- Synthesis of distributed algorithms using asynchronous automata.
This page was built for publication: Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599069)