# Equivalence between flow graphs

Bisimulation on single-coloured flow graphs is the same as tree unfolding.

For two-coloured flow graphs we require that value nodes can be copied and discarded, but that central nodes cannot:

We require a simulation between two-coloured flow graphs to be a function on central nodes.

Similarly, we require a simulation between three-coloured flow graphs to be a function on process nodes.