Abstract.
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 are the fairness criteria proposed by Apt, Francez, and Katz.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 1998 / Accepted: June 2000
Rights and permissions
About this article
Cite this article
Lamport, L. Fairness and hyperfairness. Distrib Comput 13, 239–245 (2000). https://doi.org/10.1007/PL00008921
Issue Date:
DOI: https://doi.org/10.1007/PL00008921