CSP choice Created 2026-10-31 Updated 2026-11-05
In communicating sequential processes, CSP choice combines possible process behaviours. With external choice , an offered CSP event selected by the environment can determine which branch proceeds. Internal choice leaves the branch selection nondeterministic from the environment's viewpoint. For example, choosing externally between receiving
left and receiving right offers both alternatives; internally choosing a branch can remove one offer before the environment acts. Sets of execution traces alone can hide this distinction, so CSP failures semantics also records CSP refusal sets of CSP events that may be declined. CSP failures semantics 2026-11-05
CSP failures semantics augments visible traces with refusal information. In the stable failures model, a pair means that after visible trace , the process can reach a stable state with no internal transition and no offered event in . It records a possible refusal, not a requirement that every state reached after refuse .[ref]
External choice between offering and offering cannot initially refuse either offered event. Internal choice between the same branches may select the branch and refuse . Their visible trace sets can agree even though these refusals differ. Failures-divergences semantics additionally records possible infinite internal activity; it is a distinct model.
CSP process 2026-10-31
A component specified by possible CSP events and successor behaviours. has no transitions. CSP prefixing, CSP choice and CSP parallel composition construct larger components.
Past exam of the computer science course of the University of Oxford 2015 Concurrency 1 a Solution 2026-10-31
The unique fixed point principle says that a suitably guarded recursion has a unique solution in the chosen CSP semantic model. In particular, for a guarded process expression ,The same principle applies to a mutually recursive system: two tuples satisfying the same guarded equations are componentwise equal. Thus an algebraic proof may show that a candidate satisfies the defining equations, instead of comparing arbitrarily long executions individually.
A guarded recursion must make visible progress before re-entering its recursive dependency. For an equation built from CSP prefixing and CSP choice, the usual sufficient condition is that every recursive occurrence lies behind a visible CSP prefixing operation. For mutually recursive equations, every dependency cycle must pass such a guard. The guard must survive enclosing operators: an event subsequently removed by CSP hiding does not provide visible progress. Equivalently, in the usual semantic formulation the recursion functional must be contractive in observable depth. Merely seeing an arrow somewhere before the variable is insufficient.