Skip to main content


A branching time model of CSP


Rob van Glabbeek




I present a branching time model of CSP that is finer than all other models of CSP proposed thus far. It is obtained by taking a semantic equivalence from the linear time - branching time spectrum, namely divergence-preserving coupled similarity, and showing that it is a congruence for the operators of CSP. This equivalence belongs to the bisimulation family of semantic equivalences, in the sense that on transition systems without internal actions it coincides with strong bisimilarity. Nevertheless, enough of the equational laws of CSP remain to obtain a complete axiomatisation for closed, recursion-free terms.

BibTeX Entry

    publisher        = {Springer},
    doi              = {987-3-319-51045-3},
    series           = {Lecture Notes in Computer Science},
    author           = {van Glabbeek, Robert},
    month            = jan,
    volume           = {10160},
    editor           = {{Th. Gibson-Robinson, Ph.J. Hopcroft \& R. Lazic}},
    year             = {2017},
    keywords         = {process algebra, csp, branching time, coupled similarity, complete axiomatisation},
    title            = {A Branching Time Model of {CSP}},
    booktitle        = {Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of
                        His 60th Birthday},
    pages            = {272-293}