Fairness and hyperfairness in multi-party interactions

  • Authors:
  • Paul C. Attie;Nissim Francez;Orna Grumberg

  • Affiliations:
  • Department of Computer Sciences, The University of Texas at Austin;Microelectronics and Computer Technology Corporation, Austin, Texas and Computer Science Department, Technion, Haifa, Israel;Computer Science Department, Technion, Haifa, Israel

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

Quantified Score

Hi-index 0.00

Visualization

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.