Qiyi Tang

Orcid: 0000-0002-9265-3011

Affiliations:
  • University of Liverpool, UK
  • Oxford University, Department of Computer Science, UK (2019 - 2021)
  • Imperial College London, Department of Computing, UK (2018 - 2019)
  • York University, Toronto, ON, Canada (PhD 2018)


According to our database1, Qiyi Tang authored at least 31 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Optimal LTLf Synthesis.
CoRR, May, 2026

Hyper-Minimization for Deterministic Register Automata.
CoRR, May, 2026


The Complexity of Games with Randomised Control.
Proceedings of the Foundations of Software Science and Computation Structures, 2026

Good-for-MDP State Reduction for Stochastic LTL Planning.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Good-for-MDP State Reduction for Stochastic LTL Planning.
Dataset, November, 2025

wDBA Learning.
Dataset, August, 2025

Efficient Learning of Weak Deterministic Büchi Automata.
Proceedings of the ECAI 2025 - 28th European Conference on Artificial Intelligence, 25-30 October 2025, Bologna, Italy, 2025

Resolving Nondeterminism by Chance.
Proceedings of the 36th International Conference on Concurrency Theory, 2025

Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata.
Proceedings of the Computer Aided Verification - 37th International Conference, 2025

2024
Semantic flowers for good-for-games and deterministic automata.
Inf. Process. Lett., March, 2024

Bridging formal methods and machine learning with model checking and global optimisation.
J. Log. Algebraic Methods Program., February, 2024

Angluin-Style Learning of Deterministic Büchi and Co-Büchi Automata.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Minimising the Probabilistic Bisimilarity Distance.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023
On the Succinctness of Good-for-MDPs Automata.
CoRR, 2023

A novel family of finite automata for recognizing and learning ω-regular languages.
CoRR, 2023

Deciding What Is Good-For-MDPs.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

A Novel Family of Finite Automata for Recognizing and Learning ømega-Regular Languages.
Proceedings of the Automated Technology for Verification and Analysis, 2023

2022
Bridging Formal Methods and Machine Learning with Global Optimisation.
Proceedings of the Formal Methods and Software Engineering, 2022

Strategies for MDP Bisimilarity Equivalence and Inequivalence.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
Probabilistic Model Checking of Randomized Java Code.
Proceedings of the Model Checking Software - 27th International Symposium, 2021

Approximate Bisimulation Minimisation.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Comparing Labelled Markov Decision Processes.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Compiler fuzzing: how much does it matter?
Proc. ACM Program. Lang., 2019

A Systematic Impact Study for Fuzzer-Found Compiler Bugs.
CoRR, 2019

Visual Analytics for Concurrent Java Executions.
Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering, 2019

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Computing Probabilistic Bisimilarity Distances via Policy Iteration.
Proceedings of the 27th International Conference on Concurrency Theory, 2016


  Loading...