2024
Dell'Erba, D., Schewe, S., Tang, Q., & Zhanabekova, T. (2024). Semantic flowers for good-for-games and deterministic automata. Information Processing Letters, 185, 106468. doi:10.1016/j.ipl.2023.106468DOI: 10.1016/j.ipl.2023.106468
Bensalem, S., Huang, X., Ruan, W., Tang, Q., Wu, C., & Zhao, X. (2024). Bridging formal methods and machine learning with model checking and global optimisation. Journal of Logical and Algebraic Methods in Programming, 137, 100941. doi:10.1016/j.jlamp.2023.100941DOI: 10.1016/j.jlamp.2023.100941
2023
Schewe, S., Tang, Q., & Zhanabekova, T. (2023). Deciding What Is Good-For-MDPs. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 279. doi:10.4230/LIPIcs.CONCUR.2023.35DOI: 10.4230/LIPIcs.CONCUR.2023.35
A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages (Chapter)
Li, Y., Schewe, S., & Tang, Q. (2023). A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages. In Automated Technology for Verification and Analysis (pp. 53-73). Springer Nature Switzerland. doi:10.1007/978-3-031-45329-8_3DOI: 10.1007/978-3-031-45329-8_3
2022
Kiefer, S., & Tang, Q. (2022). Strategies for MDP Bisimilarity Equivalence and Inequivalence. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 243. doi:10.4230/LIPIcs.CONCUR.2022.32DOI: 10.4230/LIPIcs.CONCUR.2022.32
Bridging Formal Methods and Machine Learning with Global Optimisation (Chapter)
Huang, X., Ruan, W., Tang, Q., & Zhao, X. (2022). Bridging Formal Methods and Machine Learning with Global Optimisation. In Formal Methods and Software Engineering (pp. 1-19). Springer International Publishing. doi:10.1007/978-3-031-17244-1_1DOI: 10.1007/978-3-031-17244-1_1
2021
Kiefer, S., & Tang, Q. (2021). Approximate Bisimulation Minimisation. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 213. doi:10.4230/LIPIcs.FSTTCS.2021.48DOI: 10.4230/LIPIcs.FSTTCS.2021.48
Computing probabilistic bisimilarity distances for probabilistic automata (Journal article)
Bacci, G., Bacci, G., Larsen, K. G., Mardare, R., Tang, Q., & VAN BREUGEL, F. (2021). Computing probabilistic bisimilarity distances for probabilistic automata. Logical Methods in Computer Science, 17(1), 9:1-9:36. doi:10.23638/LMCS-17(1:9)2021DOI: 10.23638/LMCS-17(1:9)2021
Probabilistic Model Checking of Randomized Java Code (Chapter)
Fatmi, S. Z., Chen, X., Dhamija, Y., Wildes, M., Tang, Q., & van Breugel, F. (2021). Probabilistic Model Checking of Randomized Java Code. In Unknown Book (Vol. 12864, pp. 157-174). doi:10.1007/978-3-030-84629-9_9DOI: 10.1007/978-3-030-84629-9_9
2020
Comparing labelled markov decision processes (Conference Paper)
Kiefer, S., & Tang, Q. (2020). Comparing labelled markov decision processes. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 182. doi:10.4230/LIPIcs.FSTTCS.2020.49DOI: 10.4230/LIPIcs.FSTTCS.2020.49
Deciding probabilistic bisimilarity distance one for probabilistic automata (Journal article)
Tang, Q., & van Breugel, F. (2020). Deciding probabilistic bisimilarity distance one for probabilistic automata. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 111, 57-84. doi:10.1016/j.jcss.2020.02.003DOI: 10.1016/j.jcss.2020.02.003
2019
Visual Analytics for Concurrent Java Executions (Conference Paper)
Artho, C., Pande, M., & Tang, Q. (2019). Visual Analytics for Concurrent Java Executions. In 34TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE 2019) (pp. 1102-1105). doi:10.1109/ASE.2019.00112DOI: 10.1109/ASE.2019.00112
Compiler Fuzzing: How Much Does It Matter? (Journal article)
Marcozzi, M., Tang, Q., Donaldson, A. F., & Cadar, C. (2019). Compiler Fuzzing: How Much Does It Matter?. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 3. doi:10.1145/3360581DOI: 10.1145/3360581
Computing probabilistic bisimilarity distances for probabilistic automata (Conference Paper)
Bacci, G., Bacci, G., Larsen, K. G., Mardare, R., Tang, Q., & van Breugel, F. (2019). Computing probabilistic bisimilarity distances for probabilistic automata. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 140. doi:10.4230/LIPIcs.CONCUR.2019.9DOI: 10.4230/LIPIcs.CONCUR.2019.9
2018
Deciding probabilistic bisimilarity distance one for probabilistic automata (Conference Paper)
Tang, Q., & Van Breugel, F. (2018). Deciding probabilistic bisimilarity distance one for probabilistic automata. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 118. doi:10.4230/LIPIcs.CONCUR.2018.9DOI: 10.4230/LIPIcs.CONCUR.2018.9
Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains (Chapter)
Tang, Q., & van Breugel, F. (2018). Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains. In Unknown Book (Vol. 10981, pp. 681-699). doi:10.1007/978-3-319-96145-3_39DOI: 10.1007/978-3-319-96145-3_39
2017
Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains (Conference Paper)
Tang, Q., & Breugel, F. V. (2017). Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 85. doi:10.4230/LIPIcs.CONCUR.2017.27DOI: 10.4230/LIPIcs.CONCUR.2017.27
2016
Computing probabilistic bisimilarity distances via policy iteration (Conference Paper)
Tang, Q., & Van Breugel, F. (2016). Computing probabilistic bisimilarity distances via policy iteration. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 59. doi:10.4230/LIPIcs.CONCUR.2016.22DOI: 10.4230/LIPIcs.CONCUR.2016.22
