Czerwiński, WojciechWojciechCzerwińskiFröschle, Sibylle B.Sibylle B.FröschleLasota, SławomirSławomirLasota2021-11-292021-11-292010-12-17Information and Computation 209 (5): 782-798 (2011-05-01)http://hdl.handle.net/11420/11106Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different algorithmic techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA and BPP. It is derived in the setting of partially-commutative context-free processes, a new process class introduced in the paper. It subsumes both BPA and BPP and seems to be of independent interest. Expressibility issue of the new class, in comparison with the normed PA class, is also tackled in the paper.en1090-265120105782798ElsevierInformatikJournal Article10.1016/j.ic.2010.12.003Other