Skip to main content
Springer Nature Link
Log in

Isomorphisms between predicate and state transformers

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

Abstract

We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts like ‘predicate’, ‘liveness’, ‘safety’ and ‘predicate transformers’ are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin power domains and consider continuous, monotonic and unrestricted functions. We relate the transformers by isomorphisms thereby extending and completing earlier results and giving a complete picture of all the relationships.

The research of this author was supported by a grant of the Consiglio Nazionale delle Ricerche (CNR), Italy, announcement no. 203.15.3 of 15/2/90.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161–218, 1991.

    Google Scholar 

  2. K. R. Apt and G. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724–767, October 1986.

    Google Scholar 

  3. B. Alpern and F.B. Schneider. Defining liveness. Information Processing Letters, 21:181–185, 1985.

    Google Scholar 

  4. R.-J.R. Back. Correctness Preserving Program Refinements: Proof Theory and Applications, volume 131 of Mathematical Centre Tracts. Mathematical Centre, Amsterdam, 1980.

    Google Scholar 

  5. J. W. de Bakker. Mathematical Theory of Program Corretness. Prentice-Hall, 1980.

    Google Scholar 

  6. M. Bonsangue and J. N. Kok. Semantics, orderings and recursion in the weakest precondition calculus. Technical Report CS-R9267, Centre for Mathematics and Computer Science, Amsterdam, 1992. Extended abstract to appear in the proceedings of the Rex Workshop '92 'semantics: Foundations and Applications’ LNCS 666, 1993.

    Google Scholar 

  7. M. Bonsangue and J. N. Kok. Isomorphisms between state and predicate transformers. Technical report, Centre for Mathematics and Computer Science, Amsterdam, 1993. Available through anonymous ftp from ftp.cwi.nl.

    Google Scholar 

  8. F. van Breugel. Relating state transformation semantics and predicate transformer semantics for parallel programs. To appear, 1993.

    Google Scholar 

  9. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.

    Google Scholar 

  10. R. Engelking. General Topology. Polish Scientific Publishers, 1977.

    Google Scholar 

  11. P. Hitchcock and D. Park. Induction rules and termination proofs. In International Conference on Automata, Languages and Programming, 1972.

    Google Scholar 

  12. K. Hrbacek. Convex Powerdomains I. Information and computation, 74:198–225, 1987.

    Google Scholar 

  13. K. Hrbacek. Convex Powerdomains II. Information and computation, 81:290–317, 1989.

    Google Scholar 

  14. M.Z. Kwiatowska. On topological characterization of behavioural properties. In G.M. Reed, A.W. Roscoe, and R.F. Wachter, editors, Topology and Category Theory in Computer Sciences — Proc. Oxford Topology Symposioum, June 1989, pages 153–177. Oxford Science Pubblications, 1991.

    Google Scholar 

  15. L. Lamport. Proving the correctness of a multiprocess programs. IEEE Transaction on Software Eng., SE-3:125–143, 1977.

    Google Scholar 

  16. G. Milne and R. Milner. Concurrent processes and their syntax. J. ACM, 26, 2:302–321, 1979.

    Google Scholar 

  17. G. Nelson. A generalization of Dijkstra's calculus. ACM Transaction on Programming Languages and Systems, 11-4:517–561, 1989.

    Google Scholar 

  18. G. D. Plotkin. A powerdomain construction. SIAM J. Comput., 5:452–487, 1976.

    Google Scholar 

  19. G. D. Plotkin. Dijkstra's predicate transformer and Smyth's powerdomain. In Proceedings of the Winter School on Abstract Software Specification, volume 86 of Lecture Notes in Computer Science, pages 527–553. Springer-Verlag, Berlin, 1979.

    Google Scholar 

  20. G.D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes”). Department of Computer Science, Univ. of Edinburgh, 1981.

    Google Scholar 

  21. W.P. de Roever. Dijkstra's predicate transformer, non-determinism, recursion, and terminations. In Mathematical foundations of computer science, volume 45 of Lecture Notes in Computer Science, pages 472–481. Springer-Verlag, Berlin, 1976.

    Google Scholar 

  22. M.B. Smyth. Power domains. J. Comput. Syst. Sci., 16,1:23–36, 1978.

    Google Scholar 

  23. M.B. Smyth. Power domains and predicate transformers: A topological view. In Proceedings of ICALP '83 (Barcelona), volume 154 of Lecture Notes in Computer Science, pages 662–675. Springer-Verlag, Berlin, 1983.

    Google Scholar 

  24. M.B. Smyth. Topology. In S. Abramsky, D.M. Gabbay, and T.S.E. Malbaum, editors, Handbook of Logic in Computer Science, volume I — Background: Mathematical Structures. Oxford University Press, 1992.

    Google Scholar 

  25. J. von Wright. A Lattice-theoretical Basis for Program Refinement. PhD thesis, Abo Akademi, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 4079, 1009, AB Amsterdam, The Netherlands

    Marcello Bonsangue

  2. Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands

    Joost N. Kok

Authors
  1. Marcello Bonsangue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joost N. Kok
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonsangue, M., Kok, J.N. (1993). Isomorphisms between predicate and state transformers. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics