Branching Bisimilarity Checking for PRS. - Qiang Yin 002; Yuxi Fu; Chaodong He; Mingzhang Huang; Xiuting Tao (ICALP (2), 2014)

Branching Bisimilarity on Normed BPA Is EXPTIME-Complete. - Chaodong He; Mingzhang Huang (LICS, 2015)

Two Lower Bounds for BPA. - Mingzhang Huang; Qiang Yin 002 (CONCUR, 2017)

Two Lower Bounds for BPA. - Qiang Yin 002; Mingzhang Huang; Chaodong He (CoRR, 2017)

New Approaches for Almost-Sure Termination of Probabilistic Programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee (APLAS, 2018)

Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (CoRR, 2019)

Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems. - Mingzhang Huang; Hongfei Fu 001; Joost-Pieter Katoen (Inf. Comput., 2019)

Modular verification for almost-sure termination of probabilistic programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (Proc. ACM Program. Lang., 2019)

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. - Jinyi Wang; Yican Sun; Hongfei Fu 001; Mingzhang Huang; Amir Kafshdar Goharshady; Krishnendu Chatterjee (CoRR, 2020)