Concurrent Processes and Their Syntax

  title={Concurrent Processes and Their Syntax},
  author={George J. Milne and Robin Milner},
  journal={J. ACM},
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… 

On the Syntax and Semantics of Concurrent Computing

A mathematical model is presented as a common framework within which to discuss and compare different models of concurrent computation, which uses the concept of flow net to describe concurrent computation just as a conventional flowchart is used to describe serial computation.

Processes and a Fair Semantics for the Ada Rendez-Vous

It is discussed how such processes can be used to assign meanings to languages with concurrency, culminating in a definition of the ADA rendez-vous.

CIRCAL and the representation of communication, concurrency, and time

An operational semantics, acceptance semantics, is introduced, and it is in terms of this active experimentation that meaning is given to the CIRCAL syntax, thus allowing proof of system properties to be constructed.

A Model for Communicating Sequential Processes

  • C. Hoare
  • Computer Science
    On the Construction of Programs
  • 1980
A semantic model for processes based on failures is defined, which encapsulate certain finite aspects of process behaviour and allow an elegant treatment of nondeterminism, and a set of process operations are defined, including nondeterministic choice, conditional composition, and various forms of' parallel composition.

A Domain Equation for Bisimulation

A denotational semantics for SCCS based on the domain of synchronization trees is given, and proved fully abstract with respect to bisimulation.

Initial Algebra Semantics and Concurrency

  • M. Zamfir
  • Computer Science, Mathematics
  • 1987
It is shown that diamonds are free in the category of continuous parallel-nondeterministic algebras and some results concerning categories of continuous algeBRas, which can be found in the work of the ADJ group are presented in a self-contained form.

Contrasting Themes in the Semantics of Imperative Concurrency

A survey is given of work performed by the authors in recent years concerning the semantics of imperative concurrency, for which a number of operational and denotational semantic models are developed.


A survey is given of work performed by the authors in recent years concerning the semantics of imperative concurrency and a number of operational and denotational semantic models are developed.



Mathematical model of concurrent computation

A mathematical model is prsented in which we can understand and discuss the behaviour of concurrent computing agents such as interconnecting hardware modules, operating system components and parallel

Axiomatic Proof Techniques for Parallel Programs

  • S. Owicki
  • Computer Science
    Outstanding Dissertations in the Computer Sciences
  • 1975
The deductive system gives an accurate description of program execution and is powerful enough to yield a proof of any true partial correctness formula, as well as being consistent and complete with respect to an interpretive model of parallel execution.

The denotational semantics of programming languages

This paper is a tutorial introduction to the theory of programming language semantics developed by D. Scott and C. Strachey and presents a formal definition of the language GEDANKEN.

Communicating sequential processes

This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When

An axiomatic basis for computer programming

An attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics by elucidation of sets of axioms and rules of inference.

The structure of the “THE”-multiprogramming system

A multiprogramming system is described in which all activities are divided over a number of sequential processes, in each of which one or more independent abstractions have been implemented.

Initial Algebra Semantics and Continuous Algebras

An overview of initial algebra semantics is provided and the major technical feature is an initial continuous algebra which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as more basic operations.

Revised report on the algorithmic language ALGOL 68

The report gives a complete defining description of the international algorithmic language Algol 60. This is a language suitable for expressing a large class of numerical processes in a form suitably

The structure of the system.