Liveness conditions for a safe distributed deadlock resolution algorithm

Although the problem of deadlock detection and resolution in distributed systems has been studied in detail during the last years, it is still an open and difficult problem for all but the simplest models. One of the main difficulties in finding adequate solutions in the Multiple-Request model resides in the need to avoid false deadlock resolutions. In this paper we show a distributed solution with the Strong Safety Condition of "only true deadlocks must be detected/resolved". The algorithm was proved to satisfy this safety condition and now we study the liveness conditions the algorithm supports.