WQO dichotomy conjecture — proof of a special case

Decidability of many standard decision problems for Petri nets becomes an open problem once we extend the model with data.
If we restrict only to homogeneous data domains, according to the WQO Dichotomy Conjecture
there exists a simple criterion for decidability. I will sketch the proof of this conjecture for data being 2-edge-colored homogeneous graphs.