8 citations · 13 across the 5 of their papers we have counts for
5 papers · 1 filter
Modular Verification for Almost-Sure Termination of Probabilistic Programs
Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee +1
In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable app…
New Approaches for Almost-Sure Termination of Probabilistic Programs
Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee
We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound a…
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…
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…
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…