Distributed synthesis is simply undecidable

Authors:
Sven Schewe
Affiliations:
-
Venue:
Information Processing Letters
Year:
2014

Citing 7
Cited 0

Automata on Infinite Objects and Church's Problem

Automata on Infinite Objects and Church's Problem
Distributed Controller Synthesis for Local Specifications

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Synthesizing Distributed Systems

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Uniform Distributed Synthesis

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Distributed reactive systems are hard to synthesize

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On the (High) Undecidability of Distributed Synthesis Problems

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

The distributed synthesis problem of safety and reachability languages is known to be undecidable. In this article, we establish that this is the case for very simple languages, namely for safety and reachability specifications in the intersection of LTL and ACTL.