Partial mutual exclusion for infinitely many processes

Wim H. Hesselink

Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finit…