The paper is aimed at developing the concepts of program schemata for systems of concurrent communicating processes in the same way as the concepts of program schemata were introduced for sequential programs. We consider the model of parallelism when processes communicate via asynchronous channels of capacity 1. We define two models of schemata for communicating processes. The first model is based on the standard first-order model schemata for sequential programs. Another model is an extension of Ianov propositional schemata. For every model we define an equivalence relation and prove that for every pair of schemata for communicating processes their equivalence in the second model implies the equivalence of these schemata in the first model.

program scheme, system of communicating processes, run, equivalence

Mathematical problems and theory of numerical methods