| Publication | Date of Publication | Type |
|---|
Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves
ACM Transactions on Modeling and Computer Simulation | 2024-09-08 | Paper |
| Modular mix-and-match complementation of Büchi automata | 2023-12-13 | Paper |
On the power of finite ambiguity in Büchi complementation
Information and Computation | 2023-05-19 | Paper |
| Congruence Relations for Büchi Automata | 2023-04-21 | Paper |
Proving Non-inclusion of Büchi Automata Based on Monte Carlo Sampling
1517.68205 | 2022-12-22 | Paper |
| Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition | 2022-12-07 | Paper |
Polynomial-time alternating probabilistic bisimulation for interval MDPs
Dependable Software Engineering. Theories, Tools, and Applications | 2022-11-04 | Paper |
Synthesizing ranking functions for loop programs via SVM
Theoretical Computer Science | 2022-10-14 | Paper |
| A symbolic algorithm for the case-split rule in string constraint solving | 2021-07-08 | Paper |
Learning to complement Büchi automata
Lecture Notes in Computer Science | 2020-07-07 | Paper |
| Model checking \(\omega\)-regular properties for quantum Markov chains | 2020-05-27 | Paper |
Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes
Quantitative Evaluation of Systems | 2019-09-17 | Paper |
A simple algorithm for solving qualitative probabilistic parity games
Computer Aided Verification | 2019-05-03 | Paper |
The quest for minimal quotients for probabilistic and Markov automata
Information and Computation | 2018-09-27 | Paper |
An efficient synthesis algorithm for parametric Markov chains against linear time properties
(available as arXiv preprint) | 2018-08-16 | Paper |
| Exploiting robust optimization for interval probabilistic bisimulation | 2018-01-11 | Paper |
Lazy probabilistic model checking without determinisation
(available as arXiv preprint) | 2017-09-12 | Paper |
Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Deciding probabilistic automata weak bisimulation in polynomial time
(available as arXiv preprint) | 2017-01-26 | Paper |
Deciding probabilistic automata weak bisimulation: theory and practice
Formal Aspects of Computing | 2016-05-12 | Paper |
Compositional bisimulation minimization for interval Markov decision processes
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Polynomial time decision algorithms for probabilistic automata
Information and Computation | 2015-09-28 | Paper |
Cost preserving bisimulations for probabilistic automata
Logical Methods in Computer Science | 2015-01-15 | Paper |
Computing Behavioral Relations for Probabilistic Concurrent Systems
Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems | 2015-01-12 | Paper |
Deciding bisimilarities on distributions
Quantitative Evaluation of Systems | 2014-05-12 | Paper |
Cost preserving bisimulations for probabilistic automata
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The quest for minimal quotients for probabilistic automata
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Conditional automata: a tool for safe removal of negligible events
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
A quantitative doxastic logic for probabilistic processes and applications to information-hiding
Journal of Applied Non-Classical Logics | 2010-03-10 | Paper |
