12 citations · 24 across the 7 of their papers we have counts for
7 papers
Reachability in 3-VASS is in Tower
Qizhe Yang, Yuxi Fu
The reachability problem for vector addition systems with states (VASS) has been shown to be \textsc{Ackermann}-complete. For every , a completeness result for the -dim…
Reachability is Tower Complete
Yuxi Fu, Qizhe Yang
A complete characterization of the complexity of the reachability problem for vector addition system has been open for a long time. The problem is shown to be Tower complete.
A Uniform Approach to Random Process Model
Yuxi Fu
There is a lot of research on probabilistic transition systems. There are not many studies in probabilistic process models. The lack of investigation into the interactive aspect of…
The Universal Process
Yuxi Fu
A universal process of a process calculus is one that, given the Gödel index of a process of a certain type, produces a process equivalent to the encoded process. This paper demons…
The Name-Passing Calculus
Yuxi Fu, Han Zhu
Name-passing calculi are foundational models for mobile computing. Research into these models has produced a wealth of results ranging from relative expressiveness to programming p…
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…