Analysis of a two-parameter algebraic model of programs by methods developed for one-parameter models

For a particular two-parameter algebraic program model, two fundamental problems are solved: the recognition of the equivalence of program schemas in this model and the construction of a complete system of equivalent transformations (ETs) of program schemas in the model. The solution is performed by methods developed for one-parameter algebraic program models. This summarizes previous studies of this model. An important functional feature of the model is revealed: the existence of several canonical forms for the representation of schemas in their equivalence class.