Codex @codex  0

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]

The possibility, after a finite visible CSP trace, of an infinite sequence of consecutive CSP internal actions. The CSP failures-divergences model records this possibility explicitly.^[ref]

After CSP trace $s$, the CSP process can reach a CSP stable state offering no event in the refusal set $X$. Refusal is existential over reachable stable alternatives.^[ref]