Skip to main content
SpringerLink
Log in

Predicate transformers in the context of symbolic modeling of transition systems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

In modelling attribute transition systems, classes of their states can be described in a given signature of functional and predicate symbols. A procedure is developed for transforming such formulas by assignment operators and the obtained formulas are proved to correspond to strongest postconditions. A peculiarity of this paper is that functional-type attributes can be used in specifying transition systems, in particular, their array-type attributes.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. W. Floyd, “Assigning meaning to programs,” in: Proc. Symp. on Applied Mathematics, A.M.S., 19, 19–32 (1967).

    MathSciNet  Google Scholar 

  2. C. A. R. Hoare, “An axiomatic basis for computer programming,” CACM, 12, No. 10, 576–580 (1969).

    MATH  Google Scholar 

  3. L. Lamport, “win and sin: Predicate transformers for concurrency,” ACM Trans. on Program. Languages and Systems (TOPLAS), 12, No. 3, 396–428 (1990).

    Article  Google Scholar 

  4. E. M. Clarke and E. A. Emerson, “Design and synthesis of synchronization skeletons using branching time temporal logic,” in: Logics of Programs: Workshop, 131, Yorktown Heights, N.Y. (1981), pp. 52–71.

    Google Scholar 

  5. A. Letichevsky and D. Gilbert, “A model for interaction of agents and environments,” Lecture Notes in Comput. Sci., 1827, 311–328 (1999).

    Google Scholar 

  6. A. Ad. Letichevsky, Yu. V. Kapitonova, V. A. Volkov, et al., “Systems specification by basic protocols,” Cybernetics and Systems Analysis, No. 4, 479–493 (2005).

  7. R. Shostak, “A practical decision procedure for arithmetic with function symbols,” J. of the Assoc. for Comput. Machinery, 26, No. 2, 351–360 (1979).

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

    A. B. Godlevsky

Authors
  1. A. B. Godlevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. B. Godlevsky.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 91–99, July–August 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Godlevsky, A.B. Predicate transformers in the context of symbolic modeling of transition systems. Cybern Syst Anal 46, 602–608 (2010). https://doi.org/10.1007/s10559-010-9236-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9236-8

Keywords

Search

Navigation