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 π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus.
Read more about Process Calculi: Essential Features, Mathematics of Processes, Discrete and Continuous Process Algebra, History, Current Research, Software Implementations, Relationship To Other Models of Concurrency
Famous quotes containing the word process:
“The moralist and the revolutionary are constantly undermining one another. Marx exploded a hundred tons of dynamite beneath the moralist position, and we are still living in the echo of that tremendous crash. But already, somewhere or other, the sappers are at work and fresh dynamite is being tamped in place to blow Marx at the moon. Then Marx, or somebody like him, will come back with yet more dynamite, and so the process continues, to an end we cannot foresee.”
—George Orwell (1903–1950)