Skip to main content

process algebra

process algebra The algebraic study of abstract computing processes. Suppose that there is a set A of basic computational actions (such as assignments, tests, sends, requests), and that these actions can be combined to form finite and infinite processes. There are a number of operations that, given two processes p1 and p2, can form new processes; examples are the sequential composition p1.p2 and parallel composition p1||p2 of the processes. There is a great deal of freedom to define and interpret such operations and the processes they create, especially if the actions and processes may exist concurrently and communicate in various ways. Methods of communication and cooperation between processes are at the heart of process algebra. Process algebra studies semantic ideas using mainly standard algebraic methods, including: axiomatic theories whose axioms are often equations; equivalence relations (e.g. several kinds of bisimulation); algebraic constructions; and computable algebras. An example of a set of axioms for process algebra is the set ACP of J. A. Bergstra and J. W. Klop; this was developed from earlier work on process calculuses by R. Milner and others, and has subsequently been extended and adapted to express the huge range of semantic phenomena exhibited in modern concurrent communicating systems.

The motivation behind process algebra is to model computing systems using processes and to specify the systems by equations based on appropriate operators on processes. Thus concurrent computing systems are specified by equations and their semantics are obtained by solving fixed-point equations. Various related semantic and logical methods are used, including: initial algebra semantics; operational semantics based on transition systems; metric space and topological methods; and modal and temporal logics for reasoning about processes.

Process algebra has the potential to become a general theory of computing, relevant to system modeling and parallel-program development. There is much research needed to develop its foundations, tools, and applications.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

"process algebra." A Dictionary of Computing. . 24 Mar. 2019 <>.

"process algebra." A Dictionary of Computing. . (March 24, 2019).

"process algebra." A Dictionary of Computing. . Retrieved March 24, 2019 from

Learn more about citation styles

Citation styles gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).

Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.

Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, cannot guarantee each citation it generates. Therefore, it’s best to use citations as a starting point before checking the style against your school or publication’s requirements and the most-recent information available at these sites:

Modern Language Association

The Chicago Manual of Style

American Psychological Association

  • Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
  • In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.