Bisimulation equivalence and commutative context-free grammars

The topic will be the class of processes (transition systems) generated from the commutative context-free grammars. I will present a method enabling to prove decidability (and to compute the complexity) of different variants of bisimulation equivalence for the abovementioned class.