A new fault tolerant distributed algorithm for longest paths in a DAG

Self-stabilization is a relatively new approach in designing fault tolerant algorithms especially for distributed applications. The purpose of the paper is to propose a new fault tolerant (self-stabilizing) distributed algorithm for computing the longest distances for each node in a directed acyclic graph. The algorithm is simple; the technique used to prove the correctness of the algorithm is different from the existing technique of using a bounded function; it is hoped that this approach will prove to be useful in proving correctness of other self-stabilizing algorithms for graph theoretic applications