Decidability of well-connectedness for distributed synthesis

DOI10.1016/J.IPL.2012.08.018MaRDI QIDQ1941703zbMATH OpenOpenAlexFDO

Authors Paul Gastin, Nathalie Sznajder

Publication date 21 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2012.08.018

zbMATH Keywords

computational complexityconcurrencydistributed systemsformal methodssynthesis problem

Mathematics Subject Classification ID

Distributed systems (68M14) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Distributed Synthesis for Well-Connected Architectures
• Distributed synthesis for well-connected architectures
• Distributed synthesis is simply undecidable
• Distributed synthesis for acyclic architectures
• On the (High) Undecidability of Distributed Synthesis Problems

Cites work

• Complexity classification of network information flow problems
• Distributed synthesis for well-connected architectures
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• Network information flow
• Solving Sequential Conditions by Finite-State Strategies

Cited in

(7)

• Distributed synthesis is simply undecidable
• An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
• Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
• Distributed Synthesis for Well-Connected Architectures
• On the (High) Undecidability of Distributed Synthesis Problems
• scientific article; zbMATH DE number 7724201 (Why is no real title available?)
• Distributed synthesis for well-connected architectures

This page was built for publication: Decidability of well-connectedness for distributed synthesis

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