In
computer science, the
process calculi (or
process algebras) are a diverse family of related approaches for formally modelling
concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. They also provide
algebraic laws that allow process descriptions to be manipulated and analyzed, and permit formal reasoning about equivalences between processes (e.g., using
bisimulation). Leading examples of process calculi include
CSP,
CCS,
ACP, and
LOTOS. More recent additions to the family include the
p-calculus, the
ambient calculus,
PEPA, the fusion calculus and the
join-calculus.