8 citations · 20 across the 5 of their papers we have counts for
5 papers
Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph
Song Yu, Shufeng Gong, Yanfeng Zhang +7
Real-world graphs are constantly evolving, which demands updates of the previous analysis results to accommodate graph changes. By using the memoized previous computation state, in…
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…
On the Computation Power of Name Parameterization in Higher-order Processes
Xian Xu, Qiang Yin, Huan Long
Parameterization extends higher-order processes with the capability of abstraction (akin to that in lambda-calculus), and is known to be able to enhance the expressiveness. This pa…
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…
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…