Decidability of well-connectedness for distributed synthesis

DOI10.1016/j.ipl.2012.08.018zbMath1259.68091OpenAlexW2059903212MaRDI QIDQ1941703

Nathalie Sznajder, Paul Gastin

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 complexitydistributed systemsformal methodsconcurrencysynthesis problem

Mathematics Subject Classification ID

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

Cites Work

• Distributed synthesis for well-connected architectures
• Network information flow
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item

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