Distributed systems often rely on token structures to avoid undesired states and behave
correctly. While conservative token structures ensure that a fixed number of tokens exist at …

This article investigates how the use of approximations can make the formal verification of
concurrent systems scalable. We propose the idea of synchronisation analysis to …

I have spent my long career develo** the CSP process algebra, with much attention going
to make it usable in real-world problems. In this paper I reflect on this work and try to sum up …

In previous work, we have proposed an efficient technique, using local analysis, to ensure
livelock freedom of CSP systems modelled in the context of a component model, BRIC, with …