A Calculus of Mobile Processes - Note(2)

The calculus

We presuppose an infinite set N of names, and let u,v,w,x,y,z range over names. We also presuppose a set K of agent identifiers, each with an arity – an integer ≥ 0. We let A, B, C … range over agent identifiers. We now let P, Q, R, … range over the agents or process expressions, which are of six kinds as follows:

…….

The syntax of agents may be summarized as follows:

P ::= 0 | P1+P2 | y’x.P | y(x).P | r.P | (P1 | P2) | (x)P | [x=y]P | A(y1,y2,…,yn)

Note: This section is mainly about the features of the π-calculus. In this paragraph, it tell us there are six kinds of basic calculating rules of π-calculus. They are plus(P1+P2), prefix form(y’x.P, y(x).P), composition(P1 | P2), restriction( (x)P ), match( [x=y]P ) and A defined agent A(y1,y2, … ,yn). Each has its own feature, to indicate how to make the process calculus. Having given these six kinds of rules, the author make a conclusion of the general formula of the calculus.

When our attention is confined to finite agents, i.e. agents with finite behaviour, the agent identifiers and their definitions can be omitted, thus removing recursion. The π-calculus without the match form is also interesting. Although matching makes it easy to encode computation with data structures, it turns out to be unnecessary for this purpose, as we shall see in Section 4, Example 7. We include the match form partly for the clarity, and partly for the pleasant form of expansion law which it provides (rule E’ in Section 5)

A few further definitions will be needed.

…

Note: For some other condition of the agents, the former rules are not adequate. Therefore, the author add some further definitions such as free name( fn{P} means P are just those names which occur in P not bound either by a positive prefix or by a restriction ), strong match ( demand alpha-convertible ), ~x ( another expression of {x1,x2,…,xn} ), P{y1/x1,…,yn/xn}( substitution, using xi substitute yi if necessary ), prefixes for communication capabilities ( names occurring free in subject (y’x- y is the subject) ) and the precedence among the syntactic forms.

We now discuss some of the more important features of the calculus, as a preparation for the examples in the following two sections.

…..

Note: Three more important features of the calculus. They are as follows.

1.       Explaining why the π-calculus make no difference between names and variable and why it send x-linkage instead agent itself in the communicating system,.

2.       Discussing the free names of an agent represent its current knowledge or linkage of other agents and the free-tame and non-free-name expression.

3.       Explaining that restriction (x)P can solve the variable-name of no difference problem and emphasize the difference between the y(x).P and the (x)P.

Original Thesis:  http://www.lfcs.inf.ed.ac.uk/reports/89/ECS-LFCS-89-85/ECS-LFCS-89-85.ps