Weakest environment of communicating processes

Authors:
Zhou Chaochen
Affiliations:
Institute of Computing Technology, Peking, China
Venue:
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Year:
1982

Citing 1
Cited 1

Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM

Assumption---Commitment Support for CSP Model Checking

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

As is well known, the concept of the weakest precondition has played an important role in sequential programming. In this paper we introduce a similar concept for distributed programming. As far as partial correctness is concerned, given an overall specification of a distributed system and of a designated part of the system, we can find a minimum specification that must be met by the rest of the system in order that the whole system meet the overall specification. This minimum specification is called the weakest environment of the first designated part with respect to the overall specification. In terms of weakest environment, a calculus for the partial correctness of processes with a master-slave communication mechanism is also given.