A refinement of Kahn's semantics to handle non-determinism and communication (Extended Abstract)

Systems of processes connected together by communication channels are studied semantically. A model for such systems, based on traces of communication events, is described. This semantic model is more general than the stream function model described by Kahn, in that it permits processes to have a nondeterministic behaviour. The relationship between these two semantics is discussed. It is shown that the merge anomaly of Brock and Ackermann does not arise in the trace semantics.

[1]  Amir Pnueli,et al.  A linear history semantics for distributed languages extended abstract , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[2]  Stephen D. Brookes,et al.  Possible futures, acceptances, refusals, and communicating processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[4]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[5]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[6]  Vaughan R. Pratt,et al.  On the composition of processes , 1982, POPL '82.

[7]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[8]  C. A. R. Hoare,et al.  Partial Correctness of Communicating Sequential Processes , 1981, ICDCS.

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.