[0] H. Jiang, J. Fu, M. Xu, Y. Deng and Z. Li (2024): A Sample-Driven Solving Procedure for the Repeated Reachability of Quantum Continuous-time Markov Chains, in Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control (HSCC 2024), Article No. 18, pp. 1-12, ACM.

[1] J. Fu, C. Huang, Y. Li, J. Mei, M. Xu and L. Zhang (2023): Quantitative Controller Synthesis for Consumption Markov Decision Processes, Information Processing Letters, vol. 180, Article No. 106342.

[2] M. Xu, J. Fu, J. Mei and Y. Deng (2022): An Algebraic Method to Fidelity-based Model Checking over Quantum Markov Chains, Theoretical Computer Science, vol. 935: 61-81.

[3] M. Xu, J. Fu, J. Mei and Y. Deng (2022): Model Checking QCTL Plus on Quantum Markov Chains, Theoretical Computer Science, vol. 913: 43-72.

[4] M. Xu, J. Mei, J. Guan and N. Yu (2021): Model Checking Quantum Continuous-Time Markov Chains, in Proceedings of the 32nd International Conference on Concurrency Theory (CONCUR 2021), LIPIcs, vol. 203, Article No. 13, pp. 1-17, Schloss Dagstuhl.

[5] M. Xu, C. Huang and Y. Feng (2021): Measuring the Constrained Reachability in Quantum Markov Chains, Acta Informatica, vol. 58(6): 653-674.

[6] Y. Sun, M. Xu and Y. Deng (2021): An Optimal Quantum Error-Correcting Procedure Using Quantifier Elimination, Quantum Information Processing, vol. 20, Article No. 170.

[7] M. Xu and Y. Deng (2020): Time-bounded Termination Analysis for Probabilistic Programs with Delays, Information and Computation, vol. 275, Article No. 104634.

[8] P. Wang, H. Fu, K. Chatterjee, Y. Deng and M. Xu (2020): Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time, in Proceedings of the ACM on Programming Languages, vol. 4, issue POPL, Article No. 25, pp. 1-30, ACM.

[9] C. Huang, M. Xu and Z. Li (2020): A Conflict-Driven Solving Procedure for Poly-Power Constraints, Journal of Automated Reasoning, vol. 64(1), 1-20.

[10] C. Huang, J. Li, M. Xu and Z. Li (2018): Positive Root Isolation for Poly-Powers by Exclusion and Differentiation, Journal of Symbolic Computation, vol. 85, 148-169.

[11] J. Li, C. Huang, M. Xu and Z. Li (2016): Positive Root Isolation for Poly-Powers, in Proceedings of the 41st International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), pp. 325-332, ACM.

[12] M. Xu, L. Zhang, D. N. Jansen, H. Zhu and Z. Yang (2016): Multiphase Until Formulas over Markov Reward Models: An Algebraic Approach, Theoretical Computer Science, vol. 611, 116-135.

[13] M. Xu, C. Huang, Z. Li and Z. Zeng (2016): Analyzing Ultimate Positivity for Solvable Systems, Theoretical Computer Science, vol. 609, part 2: 395-412.

[14] M. Xu, Z. Li and L. Yang (2015): Quantifier Elimination for a Class of Exponential Polynomial Formulas, Journal of Symbolic Computation, vol. 68, part 1: 146-168.

[15] M. Xu and Z. Li (2013): Symbolic Termination Analysis of Solvable Loops, Journal of Symbolic Computation, vol. 50: 28-49.

[16] Y. Gao, M. Xu, N. Zhan and L. Zhang (2013): Model Checking Conditional CSL for Continuous-Time Markov Chains, Information Processing Letters, vol. 113(1-2): 44-50.