We propse a localizability criterion that allows local com-putations to be composed into a valid global one. We show that, in the presence of equivalence-robustness, most fairness notions proposed in the literature satisfy the localizability criterion. Moreover, we also present a general and efficient distributed algorithm to implement equivalence-robust fairness notions satisfying the localizability criterion. Our results theerefore offer an appealing solution to the implementation problem for existing fairness notions for distributed programming languages and algebraic models of concurrency.
展开▼
