In: Formal Aspects of Computing, Vol. 1, pages 213-228. 1989.
Abstract: Event fairness suitable for non-interleaving concurrency is proposed. Fairness is viewed with respect to concurrency in the sense that no concurrent component of the system should be delayed indefinitely. The model gives rise to a partial order. A class of generalized notions of (weak, strong and unconditional) event fairness relative to progress requirements is derived. The weakest fairness notion in this class is shown to coincide with maximality with respect to the partial order over traces.
Keywords: event fairness; trace; non-interleaving concurrency.