Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept

A formalism has been introduced for program description and synthesis, namely the matrix description of instructions. In this paper we put that formalism to work by associating with it computation methods based on a generalized P-function concept. Algorithms are derived for the optimal implementation of programs in asynchronously organized structures.