A weakest precondition semantics for communicating processes☆

https://doi.org/10.1016/0304-3975(84)90001-XGet rights and content
Under an Elsevier user license
open archive

Abstract

A weakest precondition semantics for communicating processes is presented, based on a centralized, one-level approach. Semantic equations are given for the CSP constructs and their continuity is proved. The equivalence of two weakest precondition definitions, one with certain order preferences, and another one, preference-free, is shown. The representation of various operational concepts, including delay, is discussed. Several examples of applying the rules are given.

Keywords

Weakest precondition
semantics
communicating processes
distributed programming
nondeterminism
termination
deadlock

Cited by (0)

☆

A preliminary version of this paper was presented at the 5th International Conference on programming, Torino, April 1982. Another version appeared as Tech. Rept. No. 44, Department of Computer Science, Technion, May 1982.

∗∗

The work of this author was supported by NSF Grant MCS-80-17577 from Syracuse University

∗∗∗

World Trade Visiting Scientist; on sabbatical leave from Technion, Haifa, Israel. The work of this author was supported by a Grant from IBM-Israel.

Copyright © 1984 Published by Elsevier B.V.