### 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 language | English |
---|---|

Pages (from-to) | 302-321 |

Number of pages | 20 |

Journal | Journal of the ACM (JACM) |

Volume | 26 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1 Apr 1979 |

Externally published | Yes |

### Fingerprint

### Cite this

*Journal of the ACM (JACM)*,

*26*(2), 302-321. https://doi.org/10.1145/322123.322134

}

*Journal of the ACM (JACM)*, vol. 26, no. 2, pp. 302-321. https://doi.org/10.1145/322123.322134

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

Research output: Contribution to journal › Article

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 -