Decidability of well-connectedness for distributed synthesis

Authors:
Paul Gastin;Nathalie Sznajder
Affiliations:
LSV, ENS Cachan & CNRS & INRIA, 61, Av. du Pré& INRIA, 61, Av. du Préésident Wilson, 94235 Cachan Cedex, France;LIP6, Université Pierre et Marie Curie & CNRS, 4 place Jussieu, 75005 Paris, France
Venue:
Information Processing Letters
Year:
2012

Citing 7
Cited 0

Automata on Infinite Objects and Church's Problem

Automata on Infinite Objects and Church's Problem
Complexity classification of network information flow problems

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform Distributed Synthesis

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Multiple-person alternation

SFCS '79 Proceedings of the 20th 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
Distributed synthesis for well-connected architectures

Formal Methods in System Design
Network information flow

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

Although the synthesis problem is often undecidable for distributed, synchronous systems, it becomes decidable for the subclass of uniformly well-connected (UWC) architectures, provided that only robust specifications are considered. It is then an important issue to be able to decide whether a given architecture falls in this class. This is the problem addressed in this paper: we establish the decidability and precise complexity of checking this property. This problem is in EXPSPACE and NP-hard in the general case, but falls into PSPACE when restricted to a natural subclass of architectures.