The fork calculus

Authors:
Klaus Havelund;Kim Guldstrand Larsen
Affiliations:
Ecole Normale Supérieure, Laboratoire d'Informatique 45 rue d'Ulm, 75005 Paris, France;Aalborg University, Institute for Electronic Systems, Fr. Bajersvej 7, 9220 Aalborg, Denmark
Venue:
Nordic Journal of Computing
Year:
1994

Citing 6
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
CML: A higher concurrent language

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
A semantics for ML concurrency primitives

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency

Communication and Concurrency
The Importance of the Left Merge Operator in Process Algebras

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

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, an extension of ML with concurrency primitives, amongst them a fork operator.