Parallel asynchronous computation of the values of an associative function

This paper shows an application of a formal approach to parallel program design. The basic model is related to temporal logics. We summarize the concepts of a relational model of parallelism in the introduction. The main part is devoted to the problem of synthesizing a solution for the problem of parallel asynchronous computation of the values of an associative function. The result is a programming theorem, which is wide applicable for different problems. The abstract program is easy to implement effectively on several architectures. The applicability of results is investigated for parallel architectures such as for hypercubes and transputer networks