At a basic level, a CSPM script defines processes, along with supporting functions and expressions. CSP draws freely on mathematics for these supporting terms, so the CSPM expression-language is rich and includes direct support for sequences, sets, booleans, tuples, user-defined types, local definitions, pattern-matching and lambda terms.
We will use the following variables to stand for expressions of various types.
m, n numbers s, t sequences a, A sets (the latter a set of sets) b boolean p, q processes e events c channel x general expression
When writing out equivalences, z and z' are assumed to be
fresh variables which do not introduce conflicts with the surrounding
expressions.
Go to the Next or Previous section, the Detailed Contents, or the FS(E)L Home Page.