5 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.LO2017★ 2 cited
Two Lower Bounds for BPA
Qiang Yin, Mingzhang Huang, Chaodong He
Branching bisimilarity on normed Basic Process Algebra (BPA) was claimed to be EXPTIME-hard in previous papers without any explicit proof. Recently it is reminded by Jančar that th…
cs.LO2015★ 2 cited
Branching Bisimilarity on Normed BPA Is EXPTIME-complete
Chaodong He, Mingzhang Huang
We put forward an exponential-time algorithm for deciding branching bisimilarity on normed BPA (Bacis Process Algebra) systems. The decidability of branching (or weak) bisimilarity…
cs.LO2014★ 5 cited
A Polynomial Time Algorithm for Deciding Branching Bisimilarity on Totally Normed BPA
Chaodong He
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of…