Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1927560 (Why is no real title available?)
- scientific article; zbMATH DE number 1754607 (Why is no real title available?)
- scientific article; zbMATH DE number 1759436 (Why is no real title available?)
- scientific article; zbMATH DE number 1759605 (Why is no real title available?)
- Church's Problem Revisited
- Distributed Synthesis for Well-Connected Architectures
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Local temporal logic is expressively complete for cograph dependence alphabets
- Synthesis of Asynchronous Systems
Cited in
(10)- On the (High) Undecidability of Distributed Synthesis Problems
- scientific article; zbMATH DE number 1927560 (Why is no real title available?)
- Distributed Synthesis for Well-Connected Architectures
- Distributed synthesis for regular and contextfree specifications
- Synthesis of Asynchronous Systems
- Distributed synthesis in continuous time
- Synthesis of distributed algorithms using asynchronous automata.
- Fair synthesis for asynchronous distributed systems
- Distributed synthesis for acyclic architectures
- Distributed synthesis for regular and contextfree specifications
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)