PUBLICATIONS

(See also DBLP )

Good-for-MDPs & Good-for-Games Automata

• Semantic flowers for good-for-games and deterministic automata 

Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova (IPL 2024)

• On the Succinctness of Good-for-MDPs Automata

Sven Schewe and Qiyi Tang. (draft, arXiv version).

• Deciding What is Good-for-MDPs 

Sven Schewe, Qiyi Tang, and Tansholpan Zhanabekova. (CONCUR 2023, arXiv version).

Comparison of Probabilistic Systems

Markov Decision Processes

• Strategies for MDP Bisimilarity Equivalence and Inequivalence.

Stefan Kiefer and Qiyi Tang. In Proceedings of the 33rd International Conference on Concurrency Theory (CONCUR 2022, talk, slides).

• Comparing Labelled Markov Decision Processes. 

Stefan Kiefer and Qiyi Tang. The 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020, full version, talk , slides). 

Labelled Markov Chains

• Approximate Bisimulation Minimisation.

Stefan Kiefer and Qiyi Tang. The 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021, full version, talk, slides).

• Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains. 

Qiyi Tang and Franck van Breugel. In Proceedings of the 30th International Conference on Computer Aided Verification (CAV 2018).

• Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chain. 

Qiyi Tang and Franck van Breugel. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR 2017).

• Computing Probabilistic Bisimilarity Distances via Policy Iteration. 

Qiyi Tang and Franck van Breugel. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016).

Probabilistic Automata

• Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. 

Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang and Franck van Breugel. Logical Methods in Computer Science, February 2, 2021, Volume 17, Issue 1 (LMCS 2021).  journal article of the CONCUR 2019 paper.

• Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata. 

Qiyi Tang and Franck van Breugel. Journal of Computer and System Sciences (JCSS 111:57-84, 2020).  journal article of the CONCUR 2018 paper.

• Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. 

Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang and Franck van Breugel. The 30th International Conference on Concurrency Theory (CONCUR 2019, Experiments, Extended version)

• Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata. 

Qiyi Tang and Franck van Breugel. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR 2018).

Automata Learning Through FDFA

• Angluin-Style Learning of Deterministic Buchi and Co-Buchi Automata.

Yong Li, Sven Schewe, Qiyi Tang (accepted at IJCAI 2024)

• A Novel Family of Finite Automata for Recognizing and Learning omega-Regular Languages. 

Yong Li, Sven Schewe, Qiyi Tang (ATVA 2023, arXiv)

Java Pathfinder (JPF) 

• Probabilistic Model Checking of Randomized Java Code

Syyeda Zainab Fatmi, Xiang Chen, Yash Dhamija, Maeve Wildes, Qiyi Tang and Franck van Breugel. The 27th International SPIN Symposium on Model Checking of Software (accepted by SPIN 2021, 3 minute talk)

• Visual Analytics for Concurrent Java Executions. 

Cyrille Artho, Monali Pande, Qiyi Tang. The 34th IEEE/ACM International Conference on Automated Software Engineering (Tool Demo Track) (ASE'19, tool demo).

Compilers

• Compiler Fuzzing: How Much Does It Matter?

Michaël Marcozzi, Qiyi Tang, Alastair F. Donaldson, Cristian Cadar. (SPLASH 2019 OOPSLA, arXiv,  Artifact, source code).

Theses

• Guiding Probabilistic Model Checkers by Reinforcement Learning. Qiyi Tang. (Master's thesis, 2013).

• Computing Probabilistic Bisimilarity Distances. Qiyi Tang. (PhD thesis, 2018).