| Publication | Date of Publication | Type |
|---|
Search and explore: symbiotic policy synthesis in POMDPs
Formal Methods in System Design | 2026-03-23 | Paper |
| A PSPACE algorithm for almost-sure rabin objectives in multi-environment MDPs | 2026-02-10 | Paper |
Parameter synthesis for Markov models: covering the parameter space
Formal Methods in System Design | 2024-06-28 | Paper |
| Probabilistic program verification via inductive synthesis of inductive invariants | 2024-04-05 | Paper |
| Counterexample-driven synthesis for probabilistic program sketches | 2024-03-14 | Paper |
| Efficient sensitivity analysis for parametric robust Markov chains | 2024-02-01 | Paper |
| Search and explore: symbiotic policy synthesis in POMDPs | 2024-02-01 | Paper |
| Robust almost-sure reachability in multi-environment MDPs | 2023-12-13 | Paper |
| A practitioner's guide to MDP model checking algorithms | 2023-12-13 | Paper |
Shepherding hordes of Markov chains
Tools and Algorithms for the Construction and Analysis of Systems | 2023-11-24 | Paper |
Convex Optimization for Parameter Synthesis in MDPs
IEEE Transactions on Automatic Control | 2023-09-26 | Paper |
Parameter synthesis in Markov models: a gentle survey
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Synthesis in pMDPs: a tale of 1001 parameters
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Learning language intersections
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Markov automata with multiple objectives
Formal Methods in System Design | 2023-06-29 | Paper |
Model Checking for Safe Navigation Among Humans
Quantitative Evaluation of Systems | 2023-06-28 | Paper |
On the Complexity of Reachability in Parametric Markov Decision Processes
(available as arXiv preprint) | 2023-02-03 | Paper |
Verification of Indefinite-Horizon POMDPs
1517.68225 | 2022-12-22 | Paper |
| Abstraction-Refinement for Hierarchical Probabilistic Models | 2022-12-07 | Paper |
Scenario-based verification of uncertain MDPs
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7559459 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Gradient-descent for randomized controllers under partial observability
(available as arXiv preprint) | 2022-07-08 | Paper |
Markov automata with multiple objectives
Lecture Notes in Computer Science | 2022-07-01 | Paper |
| Sampling-Based Verification of CTMCs with Uncertain Rates | 2022-05-17 | Paper |
Runtime monitors for Markov decision processes
(available as arXiv preprint) | 2022-03-25 | Paper |
Model checking finite-horizon Markov chains with probabilistic inference
(available as arXiv preprint) | 2022-03-25 | Paper |
Enforcing almost-sure reachability in POMDPs
(available as arXiv preprint) | 2022-03-25 | Paper |
Counterexample-guided inductive synthesis for probabilistic systems
Formal Aspects of Computing | 2021-09-14 | Paper |
| Finding provably optimal Markov chains | 2021-08-04 | Paper |
Inductive synthesis for probabilistic programs reaches new horizons
(available as arXiv preprint) | 2021-08-04 | Paper |
Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions
IEEE Transactions on Automatic Control | 2021-05-28 | Paper |
The complexity of reachability in parametric Markov decision processes
Journal of Computer and System Sciences | 2021-04-14 | Paper |
The complexity of reachability in parametric Markov decision processes
Journal of Computer and System Sciences | 2021-04-14 | Paper |
\textsf{PrIC3}: property directed reachability for MDPs
(available as arXiv preprint) | 2021-02-09 | Paper |
Multi-cost bounded tradeoff analysis in MDP
Journal of Automated Reasoning | 2020-11-02 | Paper |
Sequential convex programming for the efficient verification of parametric MDPs
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Are parametric Markov chains monotonic?
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
Information and Computation | 2020-05-26 | Paper |
One net fits all. A unifying semantics of dynamic fault trees using GSPNs
(available as arXiv preprint) | 2019-12-18 | Paper |
| Multi-cost bounded reachability in MDP | 2019-09-16 | Paper |
Parameter synthesis for Markov models: faster than ever
(available as arXiv preprint) | 2018-10-25 | Paper |
Fault trees on a diet: automated reduction by graph rewriting
Formal Aspects of Computing | 2017-09-08 | Paper |
Fault trees on a diet -- automated reduction by graph rewriting
Dependable Software Engineering: Theories, Tools, and Applications | 2017-08-31 | Paper |
\texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
Lecture Notes in Computer Science | 2015-11-20 | Paper |
On Gröbner bases in the context of satisfiability-modulo-theories solving over the real numbers
Algebraic Informatics | 2013-09-20 | Paper |
