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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 92)


In this chapter we have
  1. (i)

    Constructed CTs as an intuitive model of CCS;

  2. (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;

  3. (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.


Atomic Action Behaviour Program Positive Label Infinite Path Intuitive Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Personalised recommendations