Math 2.0

Computer science Semantics and logic in computer science Concept

Process calculus

Builds on Operational semantics

Summary

A process calculus, or process algebra, is a formal language for describing concurrent systems as processes that run in parallel and interact by communication. Processes are built from a few primitives, such as sending or receiving on a channel, by operators such as parallel composition, choice and restriction. Their behaviour is given by an operational semantics as a labelled transition system, and processes are compared by behavioural equivalences such as bisimilarity. The main examples are Milner's calculus of communicating systems (CCS), Hoare's communicating sequential processes (CSP), ACP and the pi-calculus.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Binary relation, concept, no evidence levelBinary relationconceptOperational semantics, concept, no evidence levelOperational semanticsconceptProcess calculus, concept, no evidence levelProcess calculusconcept
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary relation concept
  2. Operational semantics concept
  3. Process calculus concept

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Process_calculus
About this page
Tag1CQRPEWCFD
URIm2://1CQRPEWCFD
Kindconcept
WritingW0 stub
MSC68Q85, 68Q55
UsesOperational semantics
Same as
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions

Special cases