Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge

DOI10.1007/978-3-642-40313-2_61MaRDI QIDQ2849954zbMATH OpenOpenAlexFDO

Authors Anca Muscholl, Sven Schewe

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_61

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the (High) Undecidability of Distributed Synthesis Problems
• Distributed synthesis is simply undecidable
• Decidability of well-connectedness for distributed synthesis
• scientific article; zbMATH DE number 1559574
• Approximate bounded synthesis for distributed systems
• Undecidability results for distributed probabilistic systems
• Distributed synthesis for regular and contextfree specifications
• Distributed synthesis for regular and contextfree specifications
• Deducible and equivalent structural knowledges in distributed algorithms
• A practical distributed universal construction with unknown participants

Cited in

(7)

• On the (High) Undecidability of Distributed Synthesis Problems
• Distributed synthesis in continuous time
• Achieving distributed control through model checking
• Practical distributed control synthesis
• Distributed synthesis is simply undecidable
• Methods for knowledge based controlling of distributed systems
• Undecidability in decentralized supervision

This page was built for publication: Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge

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