Self-stabilizing Deadlock Detection Under the OR Requirement Model

Abstract. This article introduces a self-stabilizing deadlock-detection algorithm for the OR model. The algorithm is complete, because it de-tects all deadlocks, and it is correct, because it does not detect false deadlocks. Because of the self-stabilization property, the algorithm sup-ports dynamic changes in the wait-for graph on which it works, and transient faults; also, it can be started in an arbitrary state. Previous deadlock-detection algorithms for the OR model are not guaranteed to recover from transient faults, nor can they be started in an arbitrary state. Once the algorithm terminates, each process knows if it is or not deadlocked; moreover, deadlocked processes know whether they cause or only suffer from deadlock.