Computing Probabilistic Bisimilarity Distances via Policy Iteration. - Qiyi Tang 001; Franck van Breugel (CONCUR, 2016)

Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains. - Qiyi Tang 001; Franck van Breugel (CONCUR, 2017)

Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains. - Qiyi Tang 001; Franck van Breugel (CAV (1), 2018)

Visual Analytics for Concurrent Java Executions. - Cyrille Artho; Monali Pande; Qiyi Tang 001 (ASE, 2019)

A Systematic Impact Study for Fuzzer-Found Compiler Bugs. - Michaël Marcozzi; Qiyi Tang 001; Alastair F. Donaldson; Cristian Cadar (CoRR, 2019)

Compiler fuzzing: how much does it matter? - Michaël Marcozzi; Qiyi Tang 001; Alastair F. Donaldson; Cristian Cadar (Proc. ACM Program. Lang., 2019)

Comparing Labelled Markov Decision Processes. - Stefan Kiefer; Qiyi Tang 001 (FSTTCS, 2020)

Deciding probabilistic bisimilarity distance one for probabilistic automata. - Qiyi Tang 001; Franck van Breugel (J. Comput. Syst. Sci., 2020)

Approximate Bisimulation Minimisation. - Stefan Kiefer; Qiyi Tang 001 (FSTTCS, 2021)

Probabilistic Model Checking of Randomized Java Code. - Syyeda Zainab Fatmi; Xiang Chen; Yash Dhamija; Maeve Wildes; Qiyi Tang 001; Franck van Breugel (SPIN, 2021)

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. - Giorgio Bacci; Giovanni Bacci 001; Kim G. Larsen; Radu Mardare; Qiyi Tang 001; Franck van Breugel (Log. Methods Comput. Sci., 2021)

Strategies for MDP Bisimilarity Equivalence and Inequivalence. - Stefan Kiefer; Qiyi Tang 001 (CONCUR, 2022)

Bridging Formal Methods and Machine Learning with Global Optimisation. - Xiaowei Huang 001; Wenjie Ruan; Qiyi Tang 001; Xingyu Zhao 001 (ICFEM, 2022)

A Novel Family of Finite Automata for Recognizing and Learning ømega-Regular Languages. - Yong Li 031; Sven Schewe; Qiyi Tang 001 (ATVA (1), 2023)

Deciding What Is Good-For-MDPs. - Sven Schewe; Qiyi Tang 001; Tansholpan Zhanabekova (CONCUR, 2023)

A novel family of finite automata for recognizing and learning ω-regular languages. - Yong Li 031; Sven Schewe; Qiyi Tang 001 (CoRR, 2023)

On the Succinctness of Good-for-MDPs Automata. - Sven Schewe; Qiyi Tang 001 (CoRR, 2023)

Minimising the Probabilistic Bisimilarity Distance. - Stefan Kiefer; Qiyi Tang 001 (CONCUR, 2024)

Angluin-Style Learning of Deterministic Büchi and Co-Büchi Automata. - Yong Li 031; Sven Schewe; Qiyi Tang 001 (IJCAI, 2024)

Bridging formal methods and machine learning with model checking and global optimisation. - Saddek Bensalem; Xiaowei Huang 001; Wenjie Ruan; Qiyi Tang 001; Changshun Wu; Xingyu Zhao 001 (J. Log. Algebraic Methods Program., 2024)

Semantic flowers for good-for-games and deterministic automata. - Daniele Dell'Erba; Sven Schewe; Qiyi Tang 001; Tansholpan Zhanabekova (Inf. Process. Lett., 2024)

Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata. - Yong Li 031; Soumyajit Paul; Sven Schewe; Qiyi Tang 001 (CAV (2), 2025)

Resolving Nondeterminism by Chance. - Soumyajit Paul; David Purser; Sven Schewe; Qiyi Tang 001; Patrick Totzke; Di-De Yen (CONCUR, 2025)