| Publication | Date of Publication | Type |
|---|
| Strategy Representation by Decision Trees with Linear Classifiers | 2024-03-14 | Paper |
| Qualitative controller synthesis for consumption Markov decision processes | 2021-02-09 | Paper |
| Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS | 2021-01-20 | Paper |
| Deciding Fast Termination for Probabilistic VASS with Nondeterminism | 2020-07-20 | Paper |
| Strategy representation by decision trees in reactive synthesis | 2019-09-16 | Paper |
| Optimizing the expected mean payoff in energy Markov decision processes | 2018-10-25 | Paper |
| Zero-reachability in probabilistic multi-counter automata | 2018-04-23 | Paper |
| Long-Run Average Behaviour of Probabilistic Vector Addition Systems | 2018-04-23 | Paper |
| Stability in Graphs and Games | 2018-03-21 | Paper |
| Counterexample explanation by learning small strategies in Markov decision processes | 2018-03-01 | Paper |
| Policy learning for time-bounded reachability in continuous-time Markov decision processes via doubly-stochastic gradient ascent | 2018-01-11 | Paper |
| Trading Performance for Stability in Markov Decision Processes | 2017-07-03 | Paper |
| Measuring performance of continuous-time stochastic processes using timed automata | 2017-05-16 | Paper |
| Solvency Markov Decision Processes with Interest | 2017-02-21 | Paper |
| Verification of Open Interactive Markov Chains | 2017-01-26 | Paper |
| Trading performance for stability in Markov decision processes | 2016-11-14 | Paper |
| Efficient Analysis of Probabilistic Programs with an Unbounded Counter | 2015-08-14 | Paper |
| Branching-Time Model-Checking of Probabilistic Pushdown Automata | 2015-03-19 | Paper |
| Runtime analysis of probabilistic programs with unbounded recursion | 2014-09-22 | Paper |
| Analyzing probabilistic pushdown automata | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417673 | 2014-05-22 | Paper |
| Markov Decision Processes with Multiple Long-run Average Objectives | 2014-03-24 | Paper |
| Branching-time model-checking of probabilistic pushdown automata | 2014-01-28 | Paper |
| Local distributed model checking of RegCTL | 2013-08-16 | Paper |
| Continuous-time stochastic games with time-bounded reachability | 2013-06-06 | Paper |
| Approximating the termination value of one-counter MDPs and stochastic games | 2013-06-06 | Paper |
| Minimizing Expected Termination Time in One-Counter Markov Decision Processes | 2012-11-01 | Paper |
| Continuous-time stochastic games with time-bounded reachability | 2012-10-24 | Paper |
| On the memory consumption of probabilistic pushdown automata | 2012-10-24 | Paper |
| Stochastic game logic | 2012-10-15 | Paper |
| One-counter stochastic games | 2012-08-29 | Paper |
| Stabilization of branching queueing networks | 2012-08-23 | Paper |
| Space-efficient scheduling of stochastically generated tasks | 2012-05-24 | Paper |
| Qualitative Reachability in Stochastic BPA Games | 2012-04-24 | Paper |
| Qualitative reachability in stochastic BPA games | 2011-10-10 | Paper |
| Fixed-Delay Events in Generalized Semi-Markov Processes Revisited | 2011-09-02 | Paper |
| Approximating the Termination Value of One-Counter MDPs and Stochastic Games | 2011-07-07 | Paper |
| Runtime Analysis of Probabilistic Programs with Unbounded Recursion | 2011-07-07 | Paper |
| Reachability Games on Extended Vector Addition Systems with States | 2010-09-07 | Paper |
| Space-Efficient Scheduling of Stochastically Generated Tasks | 2010-09-07 | Paper |
| Stochastic Real-Time Games with Qualitative Timed Automata Objectives | 2010-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190774 | 2009-07-27 | Paper |
| Discounted Properties of Probabilistic Pushdown Automata | 2009-01-27 | Paper |
| Strategy Synthesis for Markov Decision Processes and Branching-Time Logics | 2008-09-18 | Paper |
| Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives | 2008-08-19 | Paper |
| Reachability in recursive Markov decision processes | 2008-05-19 | Paper |
| Deciding probabilistic bisimilarity over infinite-state probabilistic systems | 2008-04-23 | Paper |
| Reachability in Recursive Markov Decision Processes | 2007-09-04 | Paper |
| Model checking of RegCTL | 2007-03-23 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
