Skip to main content
Log in

Properties of a predicate transformer of the VRS system

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Models specified in the language of basic protocols are considered. These models are attribute transition systems, and their states are defined by formulas of multisort first-order predicate calculus over system attributes. Attributes of simple numeric and symbolic types, functional types, and queues are allowed. Assignment operators, queue update operators, and arbitrary formulas are used in postconditions of basic protocols. To pass from one state to another, a predicate transformer is constructed as a function of formula transformation. The following main property of the predicate transformer is proved: it calculates the strongest postcondition for symbolic states.

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. S. Baranov, C. Jervis, V. Kotlyarov, A. Letichevsky, and T. Weigert, “Leveraging UML to deliver correct telecom applications,” in: L. Lavagno, G. Martin, and B. Selic (eds.), UML for Real: Design of Embedded Real-Time Systems, Kluwer, Amsterdam (2003), pp. 323–342.

    Google Scholar 

  2. A. Letichevsky, J. Kapitonova, A. Letichevsky Jr, V. Volkov, S. Baranov, V. Kotlyarov, and T. Weigert, “Basic protocols, message sequence charts, and the verification of requirements specifications,” Computer Networks, No. 47, 662–675 (2005).

  3. J. Kapitonova, À. Letichevsky, V. Volkov, and T. Weigert, “Validation of embedded systems,” in: R. Zurawski (ed.), The Embedded Systems Handbook, CRC Press, Miami (2005).

    Google Scholar 

  4. A. Ad. Letichevsky, Yu. V. Kapitonova, V. A. Volkov, A. A. Letichevsky, S. N. Baranov, V. P. Kotlyarov, and T. Weigert, “Systems specification by basic protocols,” Cybernetics and Systems Analysis, No. 4, 3–21 (2005).

  5. A. Letichevsky, J. Kapitonova, V. Kotlyarov, A. Letichevsky Jr, N. Nikitchenko, V. Volkov, and T. Weigert, “Insertion modeling in distributed system design,” Problems in Programming (ISSN 1727-4907), No. 4, 13–39 (2008).

  6. E. W. Dijkstra, A Discipline of Programming, Prentice-Hall, Englewood Cliffs, N.J. (1976).

    MATH  Google Scholar 

  7. Leslie Lamport, “Win and sin: Predicate transformer for concurrency,” in: ACM Translation on Programming Language and System (TOPLAS), ACM, 12, Issue 3 (July 1990), New York (1990), pp. 396–428.

  8. A. B. Godlevsky, “Predicate transformers in the context of symbolic modeling of transition systems,” Cybernetics and Systems Analysis, No. 4, 582–588 (2010).

  9. A. Letichevsky and D. Gilbert, “A model for interaction of agents and environments,” in: D. Bert, C. Choppy, and P. Moses (eds.), Recent Trends in Algebraic Development Techniques, Lecture Notes in Computer Science 1827, Springer (1999), pp. 311–328.

  10. A. Letichevsky, “Algebra of behavior transformations and its applications,” in: V. B. Kudryavtsev and I. G. Rosenberg (eds.), Structural theory of Automata, Semigroups, and Universal Algebra, NATO Science Series II, Mathematics, Physics and Chemistry, 207, Springer (2005), pp. 241–272.

  11. M. Reniers, “Message sequence chart: Syntax and semantics,” PhD Thesis, Eindhoven University of Technology (1998).

  12. International Telecommunications Union. ITU-T Recommendation Z.120: Message Sequence Charts, ITU–T, Geneva (2002).

  13. A. A. Letichevskii, Yu. V. Kapitonova, V. P. Kotlyarov, A. A. Letichevskii Jr., and V. A. Volkov, “Semantics of timed Message Sequence Charts,” Cybernetics and Systems Analysis, No. 4, 475–484 (2002).

  14. A. Letichevsky, J. Kapitonova, V. Kotlyarov, V. Volkov, A. Letichevsky Jr, and T. Weigert, “Semantics of message sequence charts,” in: SDL Forum (2005), pp. 117–132.

  15. J. Quielle and J. Sifakis, “Specification and verification of concurrent systems in CESAR,” in: Proc. 5th Intern. Symposium on Programming (1981), pp. 142–158.

  16. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang, “Symbolic model checking: 1020 states and beyond,” Information and Computation, No. 98(2), 142–170 (1992).

  17. L. Lamport, “The temporal logic of actions,” in: ACM Transactions on Programming Languages and Systems, 16 (1994), pp. 872–923.

  18. T. Bultan and T. Yavuz-Kahveci, “Action language verifier,” in: Proc. ASE 2001 (2001), pp. 382–386.

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. A. Letichevsky.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Letichevsky, A.A., Godlevsky, A.B., Letychevsky, A.A. et al. Properties of a predicate transformer of the VRS system. Cybern Syst Anal 46, 521–532 (2010). https://doi.org/10.1007/s10559-010-9229-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9229-7

Keywords

Navigation