Concurrent Processes and Their Syntax

George Milne, Robin Milner

Research output: Contribution to journalArticle

94 Citations (Scopus)

Abstract

A mathemaucal model of concurrent computaUon is presented Starting from synchronized commumcaUon as the only pnmitwe notion, a process is defined as a set of communication capabdmes The domain of processes is budt using the weak powerdomam construction of Smyth, which evolved from that of Plotkm A minimal set of operaUons for composing processes is defined These operations suggest a corresponding mmlmal syntax--the language offlowgraphs--m which to specify these composluons The concept offlow algebra is defined, processes and flowgraphs are examples of flow algebras Elsewhere it will be shown that flowgraphs are free (over a set of generators) in the category of flow algebras, here it is shown that processes are a flow algebra, and therefore constitute a suitable semantics for flowgraphs However, we emphasize that the nouon of flowgraph evolved from the notion of process and not the reverse.

Original languageEnglish
Pages (from-to)302-321
Number of pages20
JournalJournal of the ACM (JACM)
Volume26
Issue number2
DOIs
Publication statusPublished - 1 Apr 1979
Externally publishedYes

Fingerprint

Algebra
Semantics
Communication

Cite this

Milne, George ; Milner, Robin. / Concurrent Processes and Their Syntax. In: Journal of the ACM (JACM). 1979 ; Vol. 26, No. 2. pp. 302-321.
@article{8d0774f24a5a4aba82021c2f28f8a4bd,
title = "Concurrent Processes and Their Syntax",
abstract = "A mathemaucal model of concurrent computaUon is presented Starting from synchronized commumcaUon as the only pnmitwe notion, a process is defined as a set of communication capabdmes The domain of processes is budt using the weak powerdomam construction of Smyth, which evolved from that of Plotkm A minimal set of operaUons for composing processes is defined These operations suggest a corresponding mmlmal syntax--the language offlowgraphs--m which to specify these composluons The concept offlow algebra is defined, processes and flowgraphs are examples of flow algebras Elsewhere it will be shown that flowgraphs are free (over a set of generators) in the category of flow algebras, here it is shown that processes are a flow algebra, and therefore constitute a suitable semantics for flowgraphs However, we emphasize that the nouon of flowgraph evolved from the notion of process and not the reverse.",
keywords = "algebraic semantics, communicating processes, concurrency, continuous functions, flow diagrams, nondetermmlsm, parallelism, process, semantic domains, semantics",
author = "George Milne and Robin Milner",
year = "1979",
month = "4",
day = "1",
doi = "10.1145/322123.322134",
language = "English",
volume = "26",
pages = "302--321",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

Concurrent Processes and Their Syntax. / Milne, George; Milner, Robin.

In: Journal of the ACM (JACM), Vol. 26, No. 2, 01.04.1979, p. 302-321.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Concurrent Processes and Their Syntax

AU - Milne, George

AU - Milner, Robin

PY - 1979/4/1

Y1 - 1979/4/1

N2 - A mathemaucal model of concurrent computaUon is presented Starting from synchronized commumcaUon as the only pnmitwe notion, a process is defined as a set of communication capabdmes The domain of processes is budt using the weak powerdomam construction of Smyth, which evolved from that of Plotkm A minimal set of operaUons for composing processes is defined These operations suggest a corresponding mmlmal syntax--the language offlowgraphs--m which to specify these composluons The concept offlow algebra is defined, processes and flowgraphs are examples of flow algebras Elsewhere it will be shown that flowgraphs are free (over a set of generators) in the category of flow algebras, here it is shown that processes are a flow algebra, and therefore constitute a suitable semantics for flowgraphs However, we emphasize that the nouon of flowgraph evolved from the notion of process and not the reverse.

AB - A mathemaucal model of concurrent computaUon is presented Starting from synchronized commumcaUon as the only pnmitwe notion, a process is defined as a set of communication capabdmes The domain of processes is budt using the weak powerdomam construction of Smyth, which evolved from that of Plotkm A minimal set of operaUons for composing processes is defined These operations suggest a corresponding mmlmal syntax--the language offlowgraphs--m which to specify these composluons The concept offlow algebra is defined, processes and flowgraphs are examples of flow algebras Elsewhere it will be shown that flowgraphs are free (over a set of generators) in the category of flow algebras, here it is shown that processes are a flow algebra, and therefore constitute a suitable semantics for flowgraphs However, we emphasize that the nouon of flowgraph evolved from the notion of process and not the reverse.

KW - algebraic semantics

KW - communicating processes

KW - concurrency

KW - continuous functions

KW - flow diagrams

KW - nondetermmlsm

KW - parallelism

KW - process

KW - semantic domains

KW - semantics

UR - http://www.scopus.com/inward/record.url?scp=0018455064&partnerID=8YFLogxK

U2 - 10.1145/322123.322134

DO - 10.1145/322123.322134

M3 - Article

VL - 26

SP - 302

EP - 321

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 2

ER -