Process calculus
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide tools for high-level descriptions of interactions, communications, and synchronizations between a collection of independent processes. They provide algebraic laws that allow process descriptions to be manipulated and analyzed, and they also 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 π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus.
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide tools for high-level descriptions of interactions, communications, and synchronizations between a collection of independent processes. They provide algebraic laws that allow process descriptions to be manipulated and analyzed, and they also 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 π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus. !P = P \mid !P ==Discrete and continuous process algebra== Process algebra has been studied for discrete time and continuous time (real time or dense time). ==See also== Communicating sequential processes ProVerif Stochastic probe Tamarin Prover Temporal Process Language π-calculus
Text derived from https://en.wikipedia.org/w/index.php?oldid=1352954765 under CC BY-SA 4.0; modifications have been made.