Distributed synthesis for acyclic architectures
Résumé
Synthesising distributed systems from specifications is an attractive objective, since distributed systems are notoriously difficult to get right. Unfortunately, there are very few known decidable frameworks for distributed synthesis. We present one such framework that is based on communication by rendez-vous and causal memory. This means that the specification can talk about when a communication takes place, but it cannot limit information that is transmitted during communication. This choice is both realistic and avoids some pathological reasons for undecidability. We show decidability of the synthesis problem under the restriction that the communication graph of the system is acyclic. Our result covers all ω-regular local specifications and uncontrollable rendez-vous actions. The former can be used to have e.g. fairness constraints, the latter allows to encode shared variable communication primitives.
Origine : Fichiers produits par l'(les) auteur(s)