Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge

DOI10.1007/978-3-642-40313-2_61zbMath1398.68371OpenAlexW25056010MaRDI QIDQ2849954

Sven Schewe, Anca Muscholl

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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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