Self-stabilizing distributed algorithm for local mutual inclusion

Local mutual inclusion is a process synchronization problem where, for each process, at least one of its processes and neighbors must be in the critical section. We propose a self-stabilizing distributed solution to the local mutual inclusion problem. Convergence time of the proposed algorithm is one round under the weakly fair distributed daemon. A self-stabilizing distributed algorithm for the local mutual inclusion problem is presented.The local mutual inclusion is a problem such that for each process P, at least one of P and its neighbors is in critical section.Convergence time of the proposed algorithm is 1 round under weakly fair distributed daemon.