8 citations · 15 across the 3 of their papers we have counts for
3 papers
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…
cs.LO2014★ 8 cited
Branching Bisimilarity Checking for PRS
Qiang Yin, Yuxi Fu, Chaodong He +2
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Process) and nBPA (normed Basic Process Algebra). These results lead to the ques…