Very recently, the second author showed that the question whether an equation over a trace monoid has a solution or not is decid-able 11,12]. In the original proof this question is reduced to the solv-ability of word equations with constraints, by induction on the size of the commutation relation. In the present paper we give another proof of this result using lexicographical normal forms. Our ...