Fair Synthesis for Asynchronous Distributed Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2013

Fair Synthesis for Asynchronous Distributed Systems

Résumé

We study the synthesis problem in an asynchronous distributed setting: a finite set of processes interact locally with an uncontrollable environment and communicate with each other by sending signals -- actions controlled by a sender process and that are immediately received by the target process. The fair synthesis problem is to come up with a local strategy for each process such that the resulting fair behaviors of the system meet a given specification. We consider external specifications satisfying some natural closure properties related to the architecture. We present this new setting for studying the fair synthesis problem for distributed systems, and give decidability results for the subclass of networks where communications happen through a strongly connected graph. We claim that this framework for distributed synthesis is natural, convenient and avoids most of the usual sources of undecidability for the synthesis problem. Hence, it may open the way to a decidable theory of distributed synthesis.
Fichier non déposé

Dates et versions

hal-00925735 , version 1 (08-01-2014)

Identifiants

Citer

Paul Gastin, Nathalie Sznajder. Fair Synthesis for Asynchronous Distributed Systems. ACM Transactions on Computational Logic, 2013, 14 (2), pp.9. ⟨10.1145/2480759.2480761⟩. ⟨hal-00925735⟩
172 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More