The article belongs to the theory of program schemes, which are objects designed for the analysis of formalized programs. The structure of such schemes is represented as graphs. Programs schemes with procedures are considered. A subclass of program schemes, called primitive, is defined. A methodology for the construction of full systems of equivalent transformations (E.T.) is given. This methodology is then successfully applied to construct a full system of E.T. in the primitive subclass of balanced gateway program models with left cancellation. The construction is based on the known system of E.T. for similar program models without procedures. An auxiliary type of schemes, called multiexit schemes, is used. Further research topics are given in the conclusion.

В статье рассматриваются алгебраические модели программ с процедурами. Для специфического класса моделей, связанного с изученным классом моделей программ без процедур, строится полная система эквивалентных преобразований, позволяющая проводить структурный анализ формализованных программ.