Abstract
The Fork Calculus FC presents a theory of communicating systems in family with CCS, but it differs in the way that processes are put in parallel. In CCS there is a binary parallel operator |, and two processes p and q are put in parallel by p|q. In FC there is a unary fork operator, and a process p is activated to “run in parallel with the rest of the program” by fork(p). An operational semantics is defined, and a congruence relation between processes is suggested. In addition, a sound and complete axiomatisation of the congruence is provided. FC has been developed during an investigation of the programming language CML [Rep91a], an extension of ML with concurrency primitives, amongst them a fork operator.
Cite
CITATION STYLE
Havelund, K., & Larsen, K. G. (1993). The fork calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 544–557). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_101
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
