Systematic building of a distributed recursive algorithm : example : the shortest path algorithm

Projet PARADISDesigners of distributed algorithms must deal with a variety of issues including sequential algorithms design, communication protocols, fault tolerance. The distributed design must also include a proof step of the whole algorithm features. This paper gives a new scheme for the design of distributed algorithms. In this approach the design step is performed simultaneously with the proof step. Our distributed design method is mainly based upon parallel recursive schemes, but recursivity is used in a distributed environment so we use two existing and widely available tools : remote procedure call and the PAR instruction parallel execution of threads