Summary
In this paper, a new fairness notion is proposed for languages withmulti-party interactions as the sole interprocess synchronization and communication primitive. The main advantage of this fairness notion is the elimination of starvation occurring solely due to race conditions (i.e., ordering of independent actions). Also, this is the first fairness notion for such languages which is fully adequate with respect to the criteria presented in [2]. The paper defines the notion, proves its properties, and presents examples of its usefulness.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt KR, Bouge L, Clermont P: Two normal form theorems for CSP programs IPL 26:165–171 (1987)
Apt KR, Francez N, Katz S: Appraising fairness in distributed languages Distrib Comput 2:226–241 (1988). Also: Proc 14th ACM-POPL Symp, Munich, Germany, January 1987
Apt KR, Olderog ER: Proof rules and transformations dealing with fairness Sci Comput Program 3:65–100 (1983)
Bagrodia R: A distributed algorithm to implement N-party rendezvous Tech Rep Department of Computer Science, University of Texas at Austin, June 1987
Back RJR, Kurki-Suonio R: Decentralization of process nets with centralized control Distrib Comput 3:73–87 (1989) Also: Proc 2nd ACM-PODC, Montreal, Canada, August 1983
Back RJR, Kurki-Suonio R: Cooperation in distributed systems using symmetric multiprocess handshaking Tech Rep A34, Abo Akademi 1984
Back RJR, Kurki-Suonio R: Serializability in distributed systems with handshaking Tech Rep 85-109, CMU, 1985
Back RJR, Kurki-Suonio R: Distributed cooperation with action systems. ACM Trans Program Lang Syst 10(4) 513–554 (1988)
Charlesworth A: The multiway rendezvous ACM Trans Program Lang Syst 9(2):350–366 (1987)
Chandy KM, Misra J: Synchronizing asynchronous processes —the committee-coordination problem Tech Rep Department of Computer Science, University of Texas at Austin, 1987
Chandy KM, Misra J: Parallel program design: a foundation Chap 14, Addison Wesley 1988
Dijkstra, EW: A discipline of programming Prentice-Hall 1976
Deleted
Francez N, Hailpern BT, Taubenfeld G: SCRIPT—a communication abstraction mechanism and its verification Sci Comput Program 6(1):35–88 (1986)
Forman, I.R.: On the design of large distributed systems Tech Rep STP-098-86 (Rev 1.0), MCC, Austin, Texas January 1987. A preliminary version presented at the First International Conference on Computer Languages, Miami, Florida, October 1986
Francez N: Fairness Springer, Berlin Heidelberg New York 1986
Francez N: Cooperating proofs for distributed programs with multi-party interactions IPL 32(5):235–242 (1989)
Grumberg O, Francez N, Katz S: Fair termination of communicating processes 3rd ACM-PODC Conference, Vancouver, BC, Canada, August 1984
Hoare CAR: Communicating sequential processes Commun ACM 21(8):666–678 (1978)
Hoare CAR: Communicating Sequential Processes Prentice-Hall 1985
Kuiper R, de Roever WP: Fairness assumptions for CSP in a temporal logic framework In: Biorner D (ed) Proc Tech Rep 2 Working Conference on Formal Description of Programming Concepts, Garmisch Partenkirchen North Holland 1983
Olderog ER, Apt KR: Transformations realizing fairness assumptions for parallel programs ACM Trans Programm Lang Syst 10(3):420–455 (1988)
Plotkin GD: An operational semantics for CSP In: Biorner D (ed) Tech Rep 2 Working Conference on Formal Description of Programming Concepts, Garmisch Partenkirchen, North Holland 1983
Pnueli A: Lect Notes of CS395T, Specification and verification of reactive systems University of Texas at Austin 1986
Ramesh S, Mehndiratta H: A methodology for developing distributed programs IEEE Trans Software Eng SE-13(8):967–976 (1987)
Author information
Authors and Affiliations
Additional information
Orna Grumberg received her B.Sc. degree, M.Sc. and Ph.D. in the Computer Science Department at the Technion—Israel Institute of Technology. Since 1984 she is a faculty member in the Computer Science Department at the Technion. Her research interests include verification of distributed systems, computer-aided verification, model checking, temporal logics and automata.
Paul Attie received a B.A. degree in engineering science from the University of Oxford, and an M.Sc. degree in computer science from the University of London. Since 1986, Paul has been with the Microelectronics and Computer Technology Corporation, where he is currently a member of technical staff. He is also a candidate for the Ph.D. in computer science degree at the University of Texas at Austin. His research interests include temporal logic, fairness, algebraic process theory, formal semantics, and concurrent program verification.
The photograph and autobiography of Dr. Nissim Francez were published in Volume 2, Issue No. 4, 1988 on page 226
Rights and permissions
About this article
Cite this article
Attie, P.C., Francez, N. & Grumberg, O. Fairness and hyperfairness in multi-party interactions. Distrib Comput 6, 245–254 (1993). https://doi.org/10.1007/BF02242712
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02242712