Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 23. Chapters: Communicating sequential processes, -calculus, Actor model and process calculi, Actor model and process calculi history, Process calculus, Unbounded nondeterminism, Algebra of Communicating Processes, Ambient calculus, Calculus of communicating systems, PEPA, Join-calculus, Temporal Process Language, Calculus of Broadcasting Systems, API-Calculus, Language Of Temporal Ordering Specification, MCRL2. Excerpt: In computer science, Communicating Sequential Processes (CSP) is a formal language for describing patterns of interaction in concurrent systems. It is a member of the family of mathematical theories of concurrency known as process algebras, or process calculi. CSP was highly influential in the design of the occam programming language, and also influenced the design of programming languages such as Limbo and Go. CSP was first described in a 1978 paper by C. A. R. Hoare, but has since evolved substantially. CSP has been practically applied in industry as a tool for specifying and verifying the concurrent aspects of a variety of different systems, such as the T9000 Transputer, as well as a secure ecommerce system. The theory of CSP itself is also still the subject of active research, including work to increase its range of practical applicability (e.g., increasing the scale of the systems that can be tractably analyzed). The version of CSP presented in Hoare's original 1978 paper was essentially a concurrent programming language rather than a process calculus. It had a substantially different syntax than later versions of CSP, did not possess mathematically defined semantics, and was unable to represent unbounded nondeterminism. Programs in the original CSP were written as a parallel composition of a fixed number of sequential processes communicating with each other strictly through synchronous message-passing. In ...