Fairness and conspiracies

https://doi.org/10.1016/0020-0190(84)90114-5Get rights and content

Abstract

We define a hierarchy of fairness postulates; k-fairness (∞-fairness) means the absence of any infinite execution in which some transition occurs only finitely often but is enabled infinitely often by some sequence of length ⩽ k (of unrestricted length, respectively).

We show (i) that for Petri nets in general, ∞-fairness equals k-fairness for all k, and (ii) that for a large subclass of nets, (k+1)-fairness equals k-fairness for all k. The transferral of these results to concurrent programs is also discussed.

References (15)

There are more references available in the full text version of this article.

Cited by (44)

  • Generating non-conspiratorial executions

    2007, Information Processing Letters
  • Liveness, fairness, and recurrence in Petri nets

    1999, Information Processing Letters
  • Fairness and control in multi-agent systems

    1997, Theoretical Computer Science
  • Mutex needs fairness

    1997, Information Processing Letters
  • Strong fairness and ultra metrics

    1992, Theoretical Computer Science
View all citing articles on Scopus
View full text