Operations on Processes
Naming
The low flexibility of the generated process definitions is a drawback of
both of these approaches (symmetric and asymmetric). It could be
necessary to review all other process definitions if the identification of
a process is changed.
To change all references to the old identifier to the new one, all
references to the old identity must be located. In general, solutions
utilizing indirection, as discussed next, are preferable to hard-coding
methods where identifiers must be explicitly declared.
• send(A, message)—Send a message to mailbox A.
• receive(A, message)—Receive a message from mailbox A.
In this scheme, a communication link has the following properties:
• Only if both members of a pair of processes share a mailbox is a
link made between them.
• There could be more than two processes linked to a link.
• There may be a variety of linkages existing between each pair of
communication processes, each link corresponding to one
mailbox.
Naming
The low flexibility of the generated process definitions is a drawback of
both of these approaches (symmetric and asymmetric). It could be
necessary to review all other process definitions if the identification of
a process is changed.
To change all references to the old identifier to the new one, all
references to the old identity must be located. In general, solutions
utilizing indirection, as discussed next, are preferable to hard-coding
methods where identifiers must be explicitly declared.
• send(A, message)—Send a message to mailbox A.
• receive(A, message)—Receive a message from mailbox A.
In this scheme, a communication link has the following properties:
• Only if both members of a pair of processes share a mailbox is a
link made between them.
• There could be more than two processes linked to a link.
• There may be a variety of linkages existing between each pair of
communication processes, each link corresponding to one
mailbox.
