A report on Process calculus

In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems.

- Process calculus

19 related topics with Alpha

Overall

Calculus of communicating systems

6 links

The calculus of communicating systems (CCS) is a process calculus introduced by Robin Milner around 1980 and the title of a book describing the calculus.

The "Dining Philosophers", a classic problem involving concurrency and shared resources

Concurrency (computer science)

4 links

Ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the final outcome.

Ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the final outcome.

The "Dining Philosophers", a classic problem involving concurrency and shared resources

A number of mathematical models have been developed for general concurrent computation including Petri nets, process calculi, the parallel random-access machine model, the actor model and the Reo Coordination Language.

Π-calculus

3 links

In theoretical computer science, the -calculus (or pi-calculus) is a process calculus.

Actor model

5 links

Mathematical model of concurrent computation that treats actor as the universal primitive of concurrent computation.

Mathematical model of concurrent computation that treats actor as the universal primitive of concurrent computation.

Other concurrency systems (e.g., process calculi) can be modeled in the actor model using a two-phase commit protocol.

Communicating sequential processes

2 links

Formal language for describing patterns of interaction in concurrent systems.

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, based on message passing via channels.

Concurrent computing

4 links

Form of computing in which several computations are executed concurrently—during overlapping time periods—instead of sequentially—with one completing before the next starts.

Form of computing in which several computations are executed concurrently—during overlapping time periods—instead of sequentially—with one completing before the next starts.

Beginning in the late 1970s, process calculi such as Calculus of Communicating Systems (CCS) and Communicating Sequential Processes (CSP) were developed to permit algebraic reasoning about systems composed of interacting components.

Algebra of communicating processes

2 links

Algebraic approach to reasoning about concurrent systems.

Algebraic approach to reasoning about concurrent systems.

It is a member of the family of mathematical theories of concurrency known as process algebras or process calculi.

Join-calculus

1 links

The join-calculus is a process calculus developed at INRIA.

PEPA

1 links

Performance Evaluation Process Algebra (PEPA) is a stochastic process algebra designed for modelling computer and communication systems introduced by Jane Hillston in the 1990s.

(a) Petri net trajectory example

Petri net

3 links

One of several mathematical modeling languages for the description of distributed systems.

One of several mathematical modeling languages for the description of distributed systems.

(a) Petri net trajectory example
A Petri net with an enabled transition.
The Petri net that follows after the transition fires (Initial Petri net in the figure above).
The reachability graph of N2.
An unbounded Petri net, N.
A two-bounded Petri net, obtained by extending N with "counter-places".
Petri net types graphically

Other ways of modelling concurrent computation have been proposed, including vector addition systems, communicating finite-state machines, Kahn process networks, process algebra, the actor model, and trace theory.