Finitary Fairness

@article{Alur1994FinitaryF,
  title={Finitary Fairness},
  author={Rajeev Alur and Thomas A. Henzinger},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1994},
  volume={20},
  pages={1171-1194}
}
Fairness is a mathematical abstraction: in a multiprogramming environment, fairness abstracts the details of admissible (“fair”) schedulers; in a distributed environment, fairness abstracts the relative speeds of processors. We argue that the standard definition of fairness often is unnecessarily weak and can be replaced by the stronger, yet still abstract, notion of finitary fairness. While standard weak fairness requires that no enabled transition is postponed forever, finitary weak fairness… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS