Self-stabilizing ℓ-exclusion

AbstractOur work presents a self-stabilizing solution to the ℓ-exclusion problem. This problem is a well-known generalization of the mutual-exclusion problem in which up to ℓ, but never more than ℓ, processes are allowed simultaneously in their critical sections. Self-stabilization means that even when transient failures occur and some processes crash, the system finally resumes its regular and correct behavior. The model of communication assumed here is that of shared memory, in which processes use single-writer multiple-reader regular registers