Skip to main content
Log in

On Program Schemes with Commuting and Monotone Operators

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Podlovchenko, R.I., Equivalent Transformations in the Model of Programs with Commuting and Monotone Operators, Programmirovanie, 2002, no. 6, pp. 3-18.

    Google Scholar 

  4. Podlovchenko, R.I., Program Schemes with Monotone Operators, Programmirovanie, 1988, no. 6, pp. 3-15.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025737208609

Keywords

Navigation