Carry out the bisimulation colouring algorithm step-by-step on the labelled transition system defined by thefollowing process definition, and use this to provide an equivalent system with a minimal...

Carry out the bisimulation colouring algorithm step-by-step on the labelled transition system defined by the
following process definition, and use this to provide an equivalent system with a minimal number of states.
X def= a.Y + a.(a.Z + b.W)         Z def= a.Z + b.W
Y def= a.Y + a.Z + b.W             W def= a.W

how to draw that part: X def= a.Y +
a.(a.Z + b.W)

Extracted text: