Abstract
We propose a localizability criterion that allows local computations 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 equivalencerobust fairness notions satisfying the localizability criterion. Our results therefore offer an appealing solution to the implementation problem for existing fairness notions for distributed programming languages and algebraic models of concurrency.
Research supported by the National Science Council, Taipei, Taiwan, under Grants NSC 85-2213-E-002-059, NSC 86-2213-E-002-053, and NSC 88-2213-E-002-009.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4):226–241, 1988.
R. J. R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM TOPLAS, 10(4):513–554, 1988.
T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.
G. N. Buckley and A. Silberschatz. An eéctive implementation for the generalized input-output construct of CSP. ACM TOPLAS, 5(2):223–235, 1983.
H.-D. Burkhard. Fairness and control in multi-agent systems. TCS, 189(1-2):109127, 1997.
N. Francez. Fairness. Springer-Verlag, 1986.
N. Francez, R. J. R. Back, and R. Kurki-Suonio. On equivalence-completions of fairness assumptions. Formal Aspects of Computing, 4:582–591, 1992.
N. Francez and I. R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Addison Wesley, 1996.
N. Francez, B. Hailpern, and G. Taubenfeld. Script: A communication abstraction mechanism. Science of Computer Programming, 6(1):35–88, 1986.
C. A. R. Hoare. Communicating sequential processes. CACM, 21(8):666–677, 1978.
R. R. Howell, L. E. Rosier, and H.-C. Yen. Global and local views of state fairness. TCS, 80(1):77–104, 1991.
H.-M. Järvinen and R. Kurki-Suonio. DisCo specification language: Marriage of actions and objects. In Proc. 11th ICDCS, pages 142–151, 1991.
H.-M. Järvinen, R. Kurki-Suonio, M. Sakkinen, and K. Systä. Object-oriented specification of reactive systems. In Proc. 12th Int’l Conf. on Software Engineering, pages 63–71, 1990.
Y.-J. Joung. Characterizing fairness implementability for multiparty interaction. In Proc. 23rd ICALP, pages 110–121, 1996. LNCS 1099.
Y.-J. Joung. On strong feasibilities of equivalence-completions. In Proc. 15th ACM PODC, pages 156–165, 1996.
Y.-J. Joung and S. A. Smolka. A comprehensive study of the complexity of multiparty interaction. JACM, 43(1):75–115, 1996.
L. Lamport. Time, clocks and the ordering of events in a distributed system. CACM, 21(7):558–565, 1978.
A. W. Mazurkiewicz. Concurrent program schemes and their interpretations. TR DAIMI PB-78, Aarhus University, Aarhus, Denmark, 1977.
R. Milner. Calculi for synchrony and asynchrony. TCS, 25:267–310, 1983.
R. Mi lner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Information and Computation, 100(1):1–40, 1992.
S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM TOPLAS, 4(3):455–495, 1982.
W. Reisig. Partial order semantics vs. interleaving semantics for CSP-like languages and its impact on fairness. In J. Paredaens, editor, LNCS 172, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joung, YJ. (1999). Localizability of Fairness Constraints and their Distributed Implementations. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive