| Publication | Date of Publication | Type |
|---|
| Parameter synthesis for Markov models: covering the parameter space | 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 | 2023-11-24 | Paper |
| Convex Optimization for Parameter Synthesis in MDPs | 2023-09-26 | Paper |
| Parameter synthesis in Markov models: a gentle survey | 2023-08-10 | Paper |
| Synthesis in pMDPs: a tale of 1001 parameters | 2023-07-28 | Paper |
| Learning language intersections | 2023-07-26 | Paper |
| Markov automata with multiple objectives | 2023-06-29 | Paper |
| Model Checking for Safe Navigation Among Humans | 2023-06-28 | Paper |
| On the Complexity of Reachability in Parametric Markov Decision Processes | 2023-02-03 | Paper |
| Verification of Indefinite-Horizon POMDPs | 2022-12-22 | Paper |
| Abstraction-Refinement for Hierarchical Probabilistic Models | 2022-12-07 | Paper |
| Scenario-Based Verification of Uncertain MDPs | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089265 | 2022-07-18 | Paper |
| Gradient-descent for randomized controllers under partial observability | 2022-07-08 | Paper |
| Markov automata with multiple objectives | 2022-07-01 | Paper |
| Sampling-Based Verification of CTMCs with Uncertain Rates | 2022-05-17 | Paper |
| Runtime monitors for Markov decision processes | 2022-03-25 | Paper |
| Model checking finite-horizon Markov chains with probabilistic inference | 2022-03-25 | Paper |
| Enforcing almost-sure reachability in POMDPs | 2022-03-25 | Paper |
| Counterexample-guided inductive synthesis for probabilistic systems | 2021-09-14 | Paper |
| Finding provably optimal Markov chains | 2021-08-04 | Paper |
| Inductive synthesis for probabilistic programs reaches new horizons | 2021-08-04 | Paper |
| Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions | 2021-05-28 | Paper |
| The complexity of reachability in parametric Markov decision processes | 2021-04-14 | Paper |
| \textsf{PrIC3}: property directed reachability for MDPs | 2021-02-09 | Paper |
| Multi-cost bounded tradeoff analysis in MDP | 2020-11-02 | Paper |
| Sequential Convex Programming for the Efficient Verification of Parametric MDPs | 2020-08-05 | Paper |
| Are Parametric Markov Chains Monotonic? | 2020-07-20 | Paper |
| Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination | 2020-05-26 | Paper |
| One net fits all. A unifying semantics of dynamic fault trees using GSPNs | 2019-12-18 | Paper |
| Multi-cost bounded reachability in MDP | 2019-09-16 | Paper |
| Parameter synthesis for Markov models: faster than ever | 2018-10-25 | Paper |
| Fault trees on a diet: automated reduction by graph rewriting | 2017-09-08 | Paper |
| Fault Trees on a Diet | 2017-08-31 | Paper |
| SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving | 2015-11-20 | Paper |
| On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers | 2013-09-20 | Paper |
