A system for synthesizing distributed algorithm skeletons

Linear time propositional temporal logic has been proposed as a specification language for the synthesis of distributed program skeletons by P.L. Wolper (Proc. of Principles of Prog. Lang., p.20-33, 1982). He also outlined a method for the synthesis of distributed programs with centralized controls. However, details of the implementation of the algorithms and how to overcome the centralized control of distributed programs have not been investigated. The authors report the implementation of a system to synthesize fully distributed concurrent programs. The overall structure of the system and algorithms are described. Also, their method of handling noncentralized distributed systems is presented. The system is demonstrated by its application to the synthesis of the distributed mutual exclusion algorithm. Finally the complexity and the applications of such a system are discussed.<>