Abstract
A model of sequential programs possessing the following properties is considered: (1) the result of executing operators used in the program is independent of the execution order; (2) if a logical condition used in the program has become true in the course of the execution, it remains true up to the program termination. An algorithm that resolves the scheme equivalence problem in this model is described.
Similar content being viewed by others
REFERENCES
Podlovchenko, R.I., From Yanov's Schemes to the Theory of Program Models, Matematicheskie voprosy kibernetiki (Mathematical Problems of Cybernetics), Moscow: Nauka, 1998, issue 7, pp. 281-302.
Podlovchenko, R.I., Solvability of the Equivalence Problem in the Set of Program Schemes with Monotone and Partially Commuting Operators, Programmirovanie, 1990, no. 5, pp. 3-12.
Podlovchenko, R.I., Equivalent Transformations in the Model of Programs with Commuting and Monotone Operators, Programmirovanie, 2002, no. 6, pp. 3-18.
Podlovchenko, R.I., Program Schemes with Monotone Operators, Programmirovanie, 1988, no. 6, pp. 3-15.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Podlovchenko, R.I. On Program Schemes with Commuting and Monotone Operators. Programming and Computer Software 29, 270–276 (2003). https://doi.org/10.1023/A:1025737208609
Issue Date:
DOI: https://doi.org/10.1023/A:1025737208609