Article

Free access

Fairness and hyperfairness in multi-party interactions

Authors:

Nissim Francez,

Orna GrumbergAuthors Info & Claims

POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 292 - 305

https://doi.org/10.1145/96709.96739

Published: 01 December 1989 Publication History

Abstract

In this paper, a new fairness notion is proposed for languages with multi-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 [AFK88]. The paper defines the notion, proves its properties, and presents examples of its usefulness.

References

[1]

K.R. Apt, L. Bouge, Ph. Clermont: "Two normal form theorems for CSP programs", IPL 26, 1987, pp. 165-171.

Digital Library

[2]

K.R. Apt, N. Francez, S. Katz: "Appraising Fairness in Distributed Languages", Distributed Computing 2"226-241, August 1988. Also: proc. 14th ACM-POPL symposium, Munich, Germany, Jan. 1987.

Digital Library

[3]

K.R. Apt, E.-R. Olderog: "Proof Rules and Transformations Dealing With Fairness", Science of Computer Programming 3, pp. 65-100, 1983.

[4]

R. Bagrodia: ~A Distributed Algorithm to Implement N-Party Rendezvous", TR, Dept. of Computer Science, Univ. of Texas at Austin, June 1987.

[5]

R.J.R. Back, R. Kurki-Suonio: "Decentralization of Process Nets With Centralized Control", Distributed Computing 3:73-87, 1989. Also: proc. 2nd ACM-PODC, Montzeal, Canada, August 1983.

Digital Library

[6]

R.J.R. Back, R. Kurki-Suonio: "Cooperation in distributed systems using symmetric multiprocess handshaking', TR A34, Abo Akademi, 1984.

[7]

R.J.R. Back, R. Kurki-Suonio: "Serializability in Distributed Systems With Handshaking', TR 85-109, CMU, 1985.

[8]

R.J.R. Back, R. Kurki-Suonio: "Distributed cooperation with action systems", ACM- TOPLAS 10,4: 513-554, October 1988

Digital Library

[9]

A. Charlesworth: "The Multiway Rendezvous", ACM-TOPLAS 9, 2: 350-366, July 1987.

Digital Library

[10]

K.M. Chandy, J. Misra: "Synchronizing Asynchronous Processes - the Committee- Coordination Problem", TR, Dept. of Computer Science, Univ. of Texas at Austin, 1987.

[11]

K.M. Chandy, J. Misra: Parallel Program Design: A Foundation, (chapter 14), Addison Wesley, 1988.

Digital Library

[12]

E.W. Dijkstrs: A Discipline of Programn~ng, Prentice-Hall, 1976.

Digital Library

[13]

N. Francez, W.P. de Roever: "Fairness in Communicating P~ocesses', unpublished memo, Computer Science Dept., Utrecht University, July 1980.

[14]

N. Francez, B.T. Hailpern, G. Taubenfeld: "SCRIPT- A Communication Abstraction Mechanism and Its Verification', Science of Computer Pzogzamming 6,1, pp. 35-88, Jan. 1986.

Digital Library

[15]

I.R. Foeman: "On the Design of Large Distributed Systems", TR STP-098-86 (Rev. 1.0), MCC, Austin, TX, Jan. 1987. A preliminary version presented at the First International Conf. on Computer Languages, Miami, FL, October 1986.

[16]

N. Francez: Fairness, Springcr-Verlag, 1986.

Digital Library

[17]

N. Francez" "Cooperating proofs for distributed programs with multi-party interactions", IPL Vol. 32, No. 5, pp. 235-242, September 1989.

Digital Library

[18]

O. Grumbe~8, N. Ftancez, S. Katz: "Fair Termination of Communicating Processes", 3zd ACM-PODC Conference, Vancouver, BC, Canada, August 1984.

Digital Library

[19]

C.A.R. Hoare: "Communicating Sequential Processes", CACM 21,8, pp. 666-678, August 1978.

Digital Library

[20]

C.A.R. Hoarc: Communicating Sequentlal Processes, Prentice-Hall, 1985.

Digital Library

[21]

R. Kuiper, W.P. de Roevez: "Fairness Assumptions for CSP in a Temporal Logic F~smcwork", proc. TC.2 Working Confercncc on Formal Description of Programming Concepts, Garmisch Partenkirchen (D. Biorner, ed.), North Holland, 1983.

[22]

E.-R. Olderog, K.R. Apt: "Transformations Realizing Fairness Assumptions for Parallel Programs", ACM-TOPLAS 10,3: 420-455, July 1988.

Digital Library

[23]

G.D. Plotkin: "An Operational Semantics for CSP", TC.2 working group conference on the formal description of programming concepts, Garmisch Partenkirchen, (D. Biorner, ed.), North Holland, 1983.

[24]

A. Pnucli: lecture notes of CS395T, "Specification and Verification of Reactive Systems~, Univ. of Texas at Austin, fall 1986 (notes taken by Charlie Richter).

[25]

S. Ramesh, II. Mchndiratta: "A methodology for developing distributed programs', IEEE-TSE vol. SE-13, 8: 967-976, August 1987.

Digital Library

Cited By

Francez NForman I(2005)Synchrony loosening transformations for interacting processesCONCUR '9110.1007/3-540-54430-5_90(203-219)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-54430-5_90
Francez NBack RKurki-Suonio R(1992)On equivalence-completions of fairness assumptionsFormal Aspects of Computing10.1007/BF012114764:6(582-591)Online publication date: 1-Nov-1992
https://dl.acm.org/doi/10.1007/BF01211476
Francez NForman I(1990)Interacting processes: a language for coordinated distributed programmingProceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'10.1109/JCIT.1990.128281(146-161)Online publication date: 1990
https://doi.org/10.1109/JCIT.1990.128281
Show More Cited By

Index Terms

Fairness and hyperfairness in multi-party interactions

Recommendations

Fairness and hyperfairness in multi-party interactions

In this paper, a new fairness notion is proposed for languages with multi-party interactions as the sole interprocess synchronization and communication primitive. The main advantage of this fairness notion is the elimination of starvation occurring ...
Complete fairness in secure two-party computation
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable ...
Fairness and hyperfairness

The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

December 1989

401 pages

ISBN:0897913434

DOI:10.1145/96709

Chairman:
Frances E. Allen

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
328
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)8

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Francez NForman I(2005)Synchrony loosening transformations for interacting processesCONCUR '9110.1007/3-540-54430-5_90(203-219)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-54430-5_90
Francez NBack RKurki-Suonio R(1992)On equivalence-completions of fairness assumptionsFormal Aspects of Computing10.1007/BF012114764:6(582-591)Online publication date: 1-Nov-1992
https://dl.acm.org/doi/10.1007/BF01211476
Francez NForman I(1990)Interacting processes: a language for coordinated distributed programmingProceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'10.1109/JCIT.1990.128281(146-161)Online publication date: 1990
https://doi.org/10.1109/JCIT.1990.128281
Francez NForman I(1990)Conflict propagationProceedings. 1990 International Conference on Computer Languages10.1109/ICCL.1990.63771(155-168)Online publication date: 1990
https://doi.org/10.1109/ICCL.1990.63771
Francez NForman I(1990)Superimposition for interacting processesCONCUR '90 Theories of Concurrency: Unification and Extension10.1007/BFb0039063(230-245)Online publication date: 1990
https://doi.org/10.1007/BFb0039063

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents