Distributed synthesis for well-connected architectures

Paul Gastin (1) , Nathalie Sznajder (1) , Marc Zeitoun (2)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External means that the specification only relates input and output variables. We introduce the subclass of uniformly well-connected (UWC) architectures for which there exists a routing allowing each output process to get the values of all inputs it is connected to, as soon as possible. We prove that the distributed synthesis problem is decidable on UWC architectures if and only if the set of all sets of input variables visible by output variables is totally ordered, under set inclusion. We also show that if we extend this class by letting the routing depend on the output process, then the previous decidability result fails. Finally, we provide a natural restriction on specifications under which the whole class of UWC architectures is decidable.

Domaines: Informatique et théorie des jeux [cs.GT]; Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Paul Gastin, Nathalie Sznajder, Marc Zeitoun. Distributed synthesis for well-connected architectures. FSTTCS06, 2006, Kolkata, India. pp.321-332, ⟨10.1007/11944836_30⟩. ⟨hal-00306316⟩