(definition)
Definition: An algebraic theory to formalize the notion of concurrent computation, best exemplified in CSP and CCS.
See also formal verification, formal methods.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Sandeep Kumar Shukla, "process algebra", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/processalgbr.html