Mutual exclusion in asynchronous systems with failure detectors ?
This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. This failure detector, which we call the trusting  failure detector, and which we denote by T T , is strictly weaker than the perfect failure detector P P but strictly stronger than the eventually perfect failure detector ?P ? P . The paper shows that a majority of correct processes is necessary to solve the problem with T T . Moreover, T T is also the weakest failure detector to solve the fault-tolerant group mutual exclusion problem, given a majority of correct processes.
mutual exclusion asynchronous system failure detectors fault-tolerance group mutual exclusion