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

Authors:
R. J.R. Back;H. Mannila
Affiliations:
-;-
Venue:
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
1982

Citing 4
Cited 2

Communicating sequential processes

Communications of the ACM
A Calculus of Communicating Systems

A Calculus of Communicating Systems
On the composition of processes

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scenarios: A Model of Non-Determinate Computation

Proceedings of the International Colloquium on Formalization of Programming Concepts

A fixpoint semantics for nondeterministic data flow

Journal of the ACM (JACM)
Concurrent transition system semantics of process networks

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

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.