Decidability of well-connectedness for distributed synthesis

Paul Gastin , Nathalie Sznajder (1)

1 MoVe - Modélisation et Vérification

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.

Domaines: Informatique [cs]

Paul Gastin, Nathalie Sznajder. Decidability of well-connectedness for distributed synthesis. Information Processing Letters, 2012, 112 (24), pp.963-968. ⟨10.1016/j.ipl.2012.08.018⟩. ⟨hal-01176415⟩