Czerwiński, WojciechWojciechCzerwińskiFröschle, Sibylle B.Sibylle B.FröschleLasota, SławomirSławomirLasota2021-12-132021-12-132009-10-16Lecture Notes in Computer Science (5710 LNCS): 259-273 (2009-10-16)http://hdl.handle.net/11420/11274Bisimulation 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 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.enInformatikPhysikTechnikConference Paper10.1007/978-3-642-04081-8_18Other