Abstract
We extend the well-known hierarchy ∞-fair ⊆ 0-fair ⊆ just for sequences (sequential computations) to that of traces (concurrent processes). The fairness hierarchy for traces is similar, but more involved than for sequences. We study this hierarchy, first in general, abstracting from concrete concurrent system, then for basic classes of Petri nets – elementary and place/transition nets. Finally, we define the fairness notions in a non-interleaving way and compare them with the former ones.
Get full access to this article
View all access options for this article.