Two process graphs, given as states in a labelled transition
system, are isomorphic if they only differ in the identity of
the nodes.
Here is a formal
definition. Given a CCS expression \(P\), one can use the
denotational semantics given in
the notes to give the meaning of \(P\) as a process graph, or
we can distill a process graph from the LTS generated by the CCS
SOS, namely by taking all states and transitions reachable from
\(P\). It is a theorem that those two graphs, both representing
the meaning of \(P\), are always bisimulation equivalent.
Give a counterexample, showing that they are not always
isomorphic.