6. Communication trees (CTs) as a model of CCS

Abstract

In this chapter we have

• (i) Constructed CTs as an intuitive model of CCS;

• (ii) Shown that, in considering atomic actions and strong equivalence of programs, we are justified in considering these notions as they apply to the denoted CTs;

• (iii) Shown that many useful program equivalence laws are actually identifies for CTs.

We have not studied the wider relation of observation-equivalence over programs. But it turns out that, for any equivalence relation which is defined in terms of $\xrightarrow{{\mu v}}$ and/or ∼, we can think of this also as as equivalence relation over CTs.