default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiyi Tang 0001
Person information
- unicode name: 汤淇伊
- affiliation: University of Liverpool, UK
- affiliation (2019 - 2021): Oxford University, Department of Computer Science, UK
- affiliation (2018 - 2019): Imperial College London, Department of Computing, UK
- affiliation (PhD 2018): York University, Toronto, ON, Canada
Other persons with the same name
- Qiyi Tang
- Qiyi Tang 0002 — Beijing University of Posts and Telecommunications, School of Computer Science, China (and 1 more)
- Qiyi Tang 0003
![[0000-0002-8200-7518]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-8200-7518")
— Tencent AI Lab, Shenzhen, China - Qiyi Tang 0004 — Howard University College of Medicine, Washington, DC, USA
2020 – today
- 2024
[j5]Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova:
Semantic flowers for good-for-games and deterministic automata. Inf. Process. Lett. 185: 106468 (2024)- [j4]Saddek Bensalem, Xiaowei Huang, Wenjie Ruan, Qiyi Tang, Changshun Wu, Xingyu Zhao:
Bridging formal methods and machine learning with model checking and global optimisation. J. Log. Algebraic Methods Program. 137: 100941 (2024) - [c15]Stefan Kiefer, Qiyi Tang:
Minimising the Probabilistic Bisimilarity Distance. CONCUR 2024: 32:1-32:18 - [c14]Yong Li, Sven Schewe, Qiyi Tang:
Angluin-Style Learning of Deterministic Büchi and Co-Büchi Automata. IJCAI 2024: 4506-4514 - [i8]Stefan Kiefer, Qiyi Tang:
Minimising the Probabilistic Bisimilarity Distance. CoRR abs/2406.19830 (2024) - 2023
- [c13]Yong Li, Sven Schewe, Qiyi Tang:
A Novel Family of Finite Automata for Recognizing and Learning ømega-Regular Languages. ATVA (1) 2023: 53-73 - [c12]Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova:
Deciding What Is Good-For-MDPs. CONCUR 2023: 35:1-35:16 - [i7]Yong Li, Sven Schewe, Qiyi Tang:
A novel family of finite automata for recognizing and learning ω-regular languages. CoRR abs/2307.07490 (2023) - [i6]Sven Schewe, Qiyi Tang:
On the Succinctness of Good-for-MDPs Automata. CoRR abs/2307.11483 (2023) - 2022
- [c11]Stefan Kiefer, Qiyi Tang:
Strategies for MDP Bisimilarity Equivalence and Inequivalence. CONCUR 2022: 32:1-32:22 - [c10]Xiaowei Huang, Wenjie Ruan, Qiyi Tang, Xingyu Zhao:
Bridging Formal Methods and Machine Learning with Global Optimisation. ICFEM 2022: 1-19 - [i5]Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova:
Deciding What is Good-for-MDPs. CoRR abs/2202.07629 (2022) - 2021
- [j3]Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. Log. Methods Comput. Sci. 17(1) (2021) - [c9]Stefan Kiefer, Qiyi Tang:
Approximate Bisimulation Minimisation. FSTTCS 2021: 48:1-48:16 - [c8]Syyeda Zainab Fatmi, Xiang Chen, Yash Dhamija, Maeve Wildes, Qiyi Tang, Franck van Breugel:
Probabilistic Model Checking of Randomized Java Code. SPIN 2021: 157-174 - [i4]Stefan Kiefer, Qiyi Tang:
Approximate Bisimulation Minimisation. CoRR abs/2110.00326 (2021) - 2020
- [j2]Qiyi Tang, Franck van Breugel:
Deciding probabilistic bisimilarity distance one for probabilistic automata. J. Comput. Syst. Sci. 111: 57-84 (2020) - [c7]Stefan Kiefer, Qiyi Tang:
Comparing Labelled Markov Decision Processes. FSTTCS 2020: 49:1-49:16 - [i3]Stefan Kiefer, Qiyi Tang:
Comparing Labelled Markov Decision Processes. CoRR abs/2009.11643 (2020)
2010 – 2019
- 2019
- [j1]Michaël Marcozzi, Qiyi Tang, Alastair F. Donaldson, Cristian Cadar:
Compiler fuzzing: how much does it matter? Proc. ACM Program. Lang. 3(OOPSLA): 155:1-155:29 (2019) - [c6]Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. CONCUR 2019: 9:1-9:17 - [c5]Cyrille Artho, Monali Pande, Qiyi Tang:
Visual Analytics for Concurrent Java Executions. ASE 2019: 1102-1105 - [i2]Michaël Marcozzi, Qiyi Tang, Alastair F. Donaldson, Cristian Cadar:
A Systematic Impact Study for Fuzzer-Found Compiler Bugs. CoRR abs/1902.09334 (2019) - [i1]Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. CoRR abs/1907.01768 (2019) - 2018
- [c4]Qiyi Tang, Franck van Breugel:
Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains. CAV (1) 2018: 681-699 - [c3]Qiyi Tang, Franck van Breugel:
Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata. CONCUR 2018: 9:1-9:17 - 2017
- [c2]Qiyi Tang, Franck van Breugel:
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains. CONCUR 2017: 27:1-27:16 - 2016
- [c1]Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances via Policy Iteration. CONCUR 2016: 22:1-22:15
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-22 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
