A simple model of distributed programs based on implementation-hiding and process autonomy

Authors:
K. M. Chandy;J. Misra
Affiliations:
University of Texas at Austin, Austin, TX;University of Texas at Austin, Austin, TX
Venue:
ACM SIGPLAN Notices
Year:
1980

Citing 2
Cited 1

Communicating sequential processes

Communications of the ACM
An Axiomatic Proof Technique for Networks of Communicating Processes

An Axiomatic Proof Technique for Networks of Communicating Processes

Solving the “N

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a model for a network of communicating processes. We extend well known ideas in sequential programming such as procedures, parameter passing and binding, and recursion to distributed programs. We stress the notion of implementation-hiding, i.e. the invoker of a process or procedure has no knowledge of the implementation of the invoked computation.