Actor model and process calculi


In computer science, the Actor model and process calculi are two closely related approaches to the modelling of concurrent digital computation. See Actor model and process calculi history.
There are many similarities between the two approaches, but also several differences :
The publications on the Actor model and on process calculi have a fair number of cross-references, acknowledgments, and reciprocal citations.

How do channels work?

Indirect communication using channels has been an important issue for communication in parallel and concurrent computation affecting both semantics and performance. Some process calculi differ from the Actor model in their use of channels as opposed to direct communication.

Synchronous channels

Synchronous channels have the property that a sender putting a message in the channel must wait for a receiver to get the message out of the channel before the sender can proceed.

Simple synchronous channels

A synchronous channel can be modeled by an Actor that receives put and get communications. The following is the behavior of an Actor for a simple synchronous channel:
However, simple synchronous channels do not suffice for process calculi such as Communicating Sequential Processes because use of the guarded choice command. In a guarded choice command multiple offers can be made concurrently on multiple channels to put and get messages; however at most one of the guards can be chosen for each execution of the guarded choice command. Because only one guard can be chosen, a guarded choice command in general effectively requires a kind of two-phase commit protocol or perhaps even a three-phase commit protocol if time-outs are allowed in guards.
Consider the following program written in CSP :
||
Z :: n: integer; n:= 0;
* Y?go → n := n+1; Y!true]
]
According to Clinger , this program illustrates global nondeterminism, since the nondeterminism arises from incomplete specification of the timing of signals between the three processes X, Y, and Z. The repetitive guarded command in the definition of Z has two alternatives:
  1. the stop message is accepted from X, in which case Y is sent the value false and print is sent the value n
  2. a go message is accepted from Y, in which case n is incremented and Y is sent the value true.
If Z ever accepts the stop message from X, then X terminates. Accepting the stop causes Y to be sent false which when input as the value of its guard will cause Y to terminate. When both X and Y have terminated, Z terminates because it no longer has live processes providing input.
In the above program, there are synchronous channels from X to Z, Y to Z, and Z to Y.

Analogy with the committee coordination problem

According to Knabe , Chandy and Misra characterized this as analogous to the committee coordination problem:

A simple distributed protocol

This section presents a simple distributed protocol for channels in synchronous process calculi. The protocol has some problems that are addressed in the sections below.
The behavior of a guarded choice command is as follows:
The behavior of a guard is as follows:
The behavior of a channel is as follows:
Again consider the program written in CSP :
||
Z :: n: integer; n:= 0;
* Y?go → n := n+1; Y!true]
]
As pointed out in Knabe , a problem with the above protocol is that the process Z might never accept the stop message from X and consequently the above program might never print anything.
In contrast consider, a simple Actor system that consists of Actors X, Y, Z, and print where
By the laws of Actor semantics, the above Actor system will always halt when the Actors X, Y, are Z are each sent a "start" message resulting in sending print a number that can be unbounded large.
The difference between the CSP program and the Actor system is that the Actor Z does not get messages using a guarded choice command from multiple channels. Instead it processes messages in arrival ordering, and by the laws for Actor systems, the stop message is guaranteed to arrive.

Livelock on getting from multiple channels

Consider the following program written in CSP :
Bids2?b → process1!b;] ||
Bidder2 :: b: bid;
* Bids2?b → process2!b;]
]
As pointed out in Knabe , an issue with the above protocol is that the process Bidder2 might never accept a bid from Bid1 or Bid2 and consequently process2 might never be sent anything. In each attempt to accept a message, Bidder2 is thwarted because the bid that was offered by Bids1 or Bids2 is snatched away by Bidder1 because it turns out that Bidder1 has much faster access than Bidder2 to Bids1 and Bids2. Consequently, Bidder1 can accept a bid, process it and accept another bid before Bidder2 can commit to accepting a bid.

Efficiency

As pointed out in Knabe , an issue with the above protocol is the large number of communications that must be sent in order to perform the handshaking in order to send a message through a synchronous channel. Indeed, as shown in the previous section, the number of communications can be unbounded.

Summary of Issues

The subsections above have articulated the following three issues concerned with the use of synchronous channels for process calculi:
  1. Starvation. The use of synchronous channels can cause starvation when a process attempts to get messages from multiple channels in a guarded choice command.
  2. Livelock. The use of synchronous channels can cause a process to be caught in livelock when it attempts to get messages from multiple channels in a guarded choice command.
  3. Efficiency. The use of synchronous channels can require a large number of communications in order to get messages from multiple channels in a guarded choice command.
It is notable that in all of the above, issues arise from the use of a guarded choice command to get messages from multiple channels.

Asynchronous channels

Asynchronous channels have the property that a sender putting a message in the channel need not wait for a receiver to get the message out of the channel.

Simple asynchronous channels

An asynchronous channel can be modeled by an Actor that receives put and get communications. The following is the behavior of an Actor for a simple asynchronous channel:
The Join-calculus programming language implemented local and distributed concurrent computations. It incorporated asynchronous channels as well as a kind of synchronous channel that is used for procedure calls. Agha's Aπ Actor calculus is based on a typed version of the asynchronous π-calculus.

Algebras

The use of algebraic techniques was pioneered in the process calculi. Subsequently, several different process calculi intended to provide algebraic reasoning about Actor systems have been developed in,,

Denotational Semantics

Will Clinger published the first satisfactory mathematical denotational theory of the Actor model using domain theory in his dissertation in 1981. His semantics contrasted the unbounded nondeterminism of the Actor model with the bounded nondeterminism of CSP and Concurrent Processes . Roscoe has developed a denotational semantics with unbounded nondeterminism for a subsequent version of Communicating Sequential Processes Hoare . More recently Carl Hewitt developed a denotational semantics for Actors based on timed diagrams.
Ugo Montanari and Carolyn Talcott have contributed to attempting to reconcile Actors with process calculi.