default search action
Andrea Turrini
Person information
- affiliation: Chinese Academy of Sciences, Institute of Software, State Key Laboratory of Computer Science. Beijing, China
- affiliation: Saarland University, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c40]Ji Guan
, Yuan Feng
Measurement-Based Verification of Quantum Markov Chains. CAV (3) 2024: 533-554 - 2023
- [j12]Weizhi Feng, Yong Li, Andrea Turrini
On the power of finite ambiguity in Büchi complementation. Inf. Comput. 292: 105032 (2023) - [j11]Chen Fu, Andrea Turrini, Xiaowei Huang, Lei Song, Yuan Feng
Model Checking for Probabilistic Multiagent Systems. J. Comput. Sci. Technol. 38(5): 1162-1186 (2023) - [j10]Yu-Fang Chen
A symbolic algorithm for the case-split rule in solving word constraints with extensions. J. Syst. Softw. 201: 111673 (2023) - [c39]Ying Liu
Scenario Approach for Parametric Markov Models. ATVA (1) 2023: 158-180 - [c38]Vojtech Havlena
Modular Mix-and-Match Complementation of Büchi Automata. TACAS (1) 2023: 249-270 - [i12]Vojtech Havlena, Ondrej Lengál, Yong Li, Barbora Smahlíková, Andrea Turrini:
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report). CoRR abs/2301.01890 (2023) - [i11]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál, Andrea Turrini:
A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report). CoRR abs/2303.01142 (2023) - [i10]Ying Liu, Andrea Turrini, Ernst Moritz Hahn, Bai Xue, Lijun Zhang:
Scenario Approach for Parametric Markov Models. CoRR abs/2304.08330 (2023) - 2022
- [j9]Yi Li, Xie Li, Yong Li, Xuechao Sun, Andrea Turrini, Lijun Zhang:
Synthesizing ranking functions for loop programs via SVM. Theor. Comput. Sci. 935: 1-20 (2022) - [j8]Meilun Li
Probabilistic Preference Planning Problem for Markov Decision Processes. IEEE Trans. Software Eng. 48(5): 1545-1559 (2022) - [c37]Yong Li
Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition. CAV (2) 2022: 152-173 - [c36]Chen Fu
EPMC Gets Knowledge in Multi-agent Systems. VMCAI 2022: 93-107 - [d2]Yong Li
Artifact for the CAV'22 paper "Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition". Version 2. Zenodo, 2022 [all versions] - [d1]Yong Li
Artifact for the CAV'22 paper "Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition". Version 1. Zenodo, 2022 [all versions] - [i9]Yong Li, Andrea Turrini, Weizhi Feng, Moshe Y. Vardi, Lijun Zhang:
Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition. CoRR abs/2206.13739 (2022) - 2021
- [c35]Yong Li
Congruence Relations for Büchi Automata. FM 2021: 465-482 - [c34]Yong Li
Synthesizing Good-Enough Strategies for LTLf Specifications. IJCAI 2021: 4144-4151 - [i8]Weizhi Feng, Yong Li, Andrea Turrini, Moshe Y. Vardi, Lijun Zhang:
On the Power of Finite Ambiguity in Büchi Complementation. CoRR abs/2109.12828 (2021) - 2020
- [c33]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving. APLAS 2020: 343-363 - [c32]Yong Li
Proving Non-inclusion of Büchi Automata Based on Monte Carlo Sampling. ATVA 2020: 467-483 - [c31]Carlos E. Budde
On Correctness, Precision, and Performance in Quantitative Verification - QComp 2020 Competition Report. ISoLA (4) 2020: 216-241 - [c30]Weizhi Feng
Modelling and Implementation of Unmanned Aircraft Collision Avoidance. SETTA 2020: 52-69 - [c29]Xie Li, Yi Li, Yong Li
SVMRanker: a general termination analysis framework of loop programs via SVM. ESEC/SIGSOFT FSE 2020: 1635-1639 - [i7]Yong Li, Andrea Turrini, Xuechao Sun, Lijun Zhang:
Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling. CoRR abs/2007.02282 (2020)
2010 – 2019
- 2019
- [j7]Ernst Moritz Hahn
Interval Markov Decision Processes with Multiple Objectives: From Robust Strategies to Pareto Curves. ACM Trans. Model. Comput. Simul. 29(4): 27:1-27:31 (2019) - [c28]Yi Li, Xuechao Sun, Yong Li
Synthesizing Nested Ranking Functions for Loop Programs via SVM. ICFEM 2019: 438-454 - [c27]Yong Li
ROLL 1.0: \omega -Regular Language Learning Library. TACAS (1) 2019: 365-371 - [i6]Ji Guan, Yuan Feng, Andrea Turrini, Mingsheng Ying:
Model Checking Applied to Quantum Physics. CoRR abs/1902.03218 (2019) - 2018
- [j6]Christian Eisentraut, Holger Hermanns
The quest for minimal quotients for probabilistic and Markov automata. Inf. Comput. 262: 162-186 (2018) - [c26]Chen Fu
Model Checking Probabilistic Epistemic Logic for Probabilistic Multiagent Systems. IJCAI 2018: 4757-4763 - [c25]Yu-Fang Chen
Advanced automata-based algorithms for program termination checking. PLDI 2018: 135-150 - [c24]Yong Li
Learning Büchi Automata and Its Applications. SETSS 2018: 38-98 - [c23]Yong Li
Learning to Complement Büchi Automata. VMCAI 2018: 313-335 - 2017
- [c22]Yuan Feng
Model Checking Omega-regular Properties for Quantum Markov Chains . CONCUR 2017: 35:1-35:16 - [c21]Ernst Moritz Hahn, Vahid Hashemi
Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes. QEST 2017: 207-223 - [c20]Vahid Hashemi
Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs. SETTA 2017: 25-41 - [c19]Carlos E. Budde
JANI: Quantitative Model and Tool Interaction. TACAS (2) 2017: 151-168 - [c18]Ernst Moritz Hahn, Sven Schewe
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games. VMCAI 2017: 266-287 - [i5]Ernst Moritz Hahn, Vahid Hashemi, Holger Hermanns, Morteza Lahijanian, Andrea Turrini:
Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes. CoRR abs/1706.06875 (2017) - 2016
- [j5]Luis María Ferrer Fioriti, Vahid Hashemi
Deciding probabilistic automata weak bisimulation: theory and practice. Formal Aspects Comput. 28(1): 109-143 (2016) - [c17]Ernst Moritz Hahn, Sven Schewe
A Simple Algorithm for Solving Qualitative Probabilistic Parity Games. CAV (2) 2016: 291-311 - [c16]Vahid Hashemi
Compositional Bisimulation Minimization for Interval Markov Decision Processes. LATA 2016: 114-126 - [c15]Ernst Moritz Hahn, Vahid Hashemi
Exploiting Robust Optimization for Interval Probabilistic Bisimulation. QEST 2016: 55-71 - [c14]Yong Li
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties. SETTA 2016: 280-296 - [i4]Yong Li, Wanwei Liu, Andrea Turrini, Ernst Moritz Hahn, Lijun Zhang:
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties. CoRR abs/1605.04400 (2016) - [i3]Ernst Moritz Hahn, Sven Schewe, Andrea Turrini, Lijun Zhang:
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games. CoRR abs/1607.01474 (2016) - [i2]Vahid Hashemi, Holger Hermanns, Andrea Turrini:
Compositional Reasoning for Interval Markov Decision Processes. CoRR abs/1607.08484 (2016) - 2015
- [j4]Andrea Turrini, Holger Hermanns
Polynomial time decision algorithms for probabilistic automata. Inf. Comput. 244: 134-171 (2015) - [c13]Meilun Li, Zhikun She, Andrea Turrini, Lijun Zhang:
Preference Planning for Markov Decision Processes. AAAI 2015: 3313-3319 - [c12]Ernst Moritz Hahn, Guangyuan Li, Sven Schewe
Lazy Probabilistic Model Checking without Determinisation. CONCUR 2015: 354-367 - [c11]Yuan Feng
QPMC: A Model Checker for Quantum Programs and Protocols. FM 2015: 265-272 - [c10]Tom van Dijk
A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking. SETTA 2015: 35-51 - 2014
- [j3]Andrea Turrini, Holger Hermanns
Cost Preserving Bisimulations for Probabilistic Automata. Log. Methods Comput. Sci. 10(4) (2014) - [c9]Ernst Moritz Hahn, Yi Li, Sven Schewe
iscasMc: A Web-Based Probabilistic Model Checker. FM 2014: 312-317 - 2013
- [j2]Vahid Hashemi, Holger Hermanns
On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 66 (2013) - [c8]Holger Hermanns, Andrea Turrini:
Cost Preserving Bisimulations for Probabilistic Automata. CONCUR 2013: 349-363 - [c7]Christian Eisentraut, Holger Hermanns, Julia Krämer, Andrea Turrini, Lijun Zhang:
Deciding Bisimilarities on Distributions. QEST 2013: 72-88 - [c6]Christian Eisentraut, Holger Hermanns, Johann Schuster, Andrea Turrini, Lijun Zhang:
The Quest for Minimal Quotients for Probabilistic Automata. TACAS 2013: 16-31 - 2012
- [c5]Holger Hermanns
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. FSTTCS 2012: 435-447 - [c4]Daniel Gebler, Vahid Hashemi
Computing Behavioral Relations for Probabilistic Concurrent Systems. ROCKS 2012: 117-155 - [i1]Holger Hermanns, Andrea Turrini:
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. CoRR abs/1205.0376 (2012) - 2010
- [c3]Roberto Segala
Conditional Automata: A Tool for Safe Removal of Negligible Events. CONCUR 2010: 539-553
2000 – 2009
- 2009
- [b1]Andrea Turrini:
Hierarchical and compositional verification of cryptographic protocols. University of Verona, Italy, 2009 - [j1]Simon Kramer
A quantitative doxastic logic for probabilistic processes and applications to information-hiding. J. Appl. Non Class. Logics 19(4): 489-516 (2009) - 2007
- [c2]Roberto Segala
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata. CSF 2007: 140-156 - 2005
- [c1]Roberto Segala
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models. QEST 2005: 44-53
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-08-03 20:11 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: