12 citations · 24 across the 7 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.LO2014★ 3 cited
Dividing Line between Decidable PDA's and Undecidable Ones
Yuxi Fu, Qiang Yin
Senizergues has proved that language equivalence is decidable for disjoint epsilon-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the nega…
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…