Communicating sequential processes 2026-10-31
A process algebra in which components communicate through synchronized CSP events. Its operational description uses a labelled transition system; standard observations include CSP traces, CSP stable failures and CSP divergences.[ref]
CSP alphabetized parallel composition 2026-10-31
The alphabets assigned to participants determine their shared CSP events. An event in both assigned alphabets requires both participants; one assigned only to a single participant advances that participant. Replicated composition synchronizes all participants whose assigned alphabets contain the event.
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 event renaming 2026-10-31
Relabel visible CSP events according to a function or relation, preserving CSP internal actions. An injective relabelling preserves event identity; a non-injective one can merge distinct actions. In relational renaming, an original event with no image is disabled. Thus partial relational renaming can also restrict an interface.
CSP exception 2026-10-31
CSP external choice 2026-10-31
CSP hiding 2026-10-31
CSP internal action 2026-10-31
An unobservable transition that the environment cannot block. CSP hiding turns selected visible CSP events into CSP internal actions.
CSP internal choice Created 2026-10-31 Updated 2026-11-05
The process may internally choose either branch, independently of the environment's offered CSP events. Consequently it can have more CSP stable failures than the corresponding CSP external choice, despite having the same CSP traces.
CSP interrupt 2026-10-31
Allow to proceed while is ready to interrupt. The first visible CSP event of discards and leaves the derivative of . A CSP internal action of alone does not discard .
CSP parallel composition 2026-10-31
Events in require both CSP processes; other visible CSP events advance one participant independently. CSP internal actions do not synchronize.
CSP prefixing 2026-10-31
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.
CSP refusal set 2026-11-05
A CSP refusal set is a set of visible CSP events that a process can decline together in a stable state. Stability excludes an enabled internal transition. Pairing with a preceding trace gives a failure observation; different internal resolutions after the same trace can produce different refusal sets.[ref]
For an event alphabet , a state offering only can refuse but cannot refuse . Every subset of a possible refusal is also possible. In a model without a separate successful-termination event, refusing the entire event alphabet signals deadlock. Refusals therefore distinguish a missing offer from an event merely not selected by the environment.
CSP step law 2026-10-31
An algebraic expansion listing the initially possible CSP events and their continuations. It translates operational transition cases into CSP external choice expressions.
CSP trace 2026-10-31
Execution trace 2026-11-05
An execution trace records the ordered steps or observations of one program execution under a chosen observation model. It might record machine instructions, state changes, procedure calls or visible communication events. The model determines what is hidden; two traces cannot be compared meaningfully without knowing their event vocabulary.
For two threads each incrementing a shared counter, a trace can record both reading zero before either writes one. Its final counter value is one even though two increments were requested. A different interleaving can produce two. One observed successful trace therefore does not establish correctness of all permitted interleavings. In communicating sequential processes, a trace conventionally records visible CSP events; internal transitions are omitted. Such a trace records what occurred but does not by itself say which unperformed events were available.
FDR2 User Manual 2026-10-31
§1.2, The CSP View of the World defines CSP events, CSP hiding, CSP refinement and the supported CSP semantic models. This source is cited for the meanings of the models, not for answers to the 2015 examination.
Labelled transition system 2026-10-31
A transition system whose edges carry action labels. A CSP operational semantics uses visible CSP events and the internal label .
Solutions to all three questions of the examination dated 1 June 2015. The cover permits answers to two questions.[ref]
Concurrency examination paper by the University of Oxford (2015). Cover; questions on printed pp. 2–5
Throughout, is the visible CSP event alphabet, is a CSP internal action, and has no transitions. There is no successful termination event. Write when implementation refines specification in model : the implementation's recorded behaviours are contained in the specification's. We use , and for the CSP traces model, CSP stable-failures model and CSP failures-divergences model.