| Publication | Date of Publication | Type |
|---|
| Mean-payoff optimization in continuous-time Markov chains with parametric alarms | 2024-09-08 | Paper |
| Regularity is decidable for normed PA processes in polynomial time | 2024-07-05 | Paper |
| Regularity is decidable for normed BPA and normed BPP processes in polynomial time | 2024-06-21 | Paper |
| The satisfiability problem for a quantitative fragment of PCTL | 2023-10-24 | Paper |
| Satisfiability of quantitative probabilistic CTL: rise to the challenge | 2023-08-10 | Paper |
| Synthesis of Optimal Resilient Control Strategies | 2022-08-12 | Paper |
| Automatic Analysis of Expected Termination Time for Population Protocols | 2021-08-04 | Paper |
| Checking qualitative liveness properties of replicated systems with stochastic scheduling | 2021-02-09 | Paper |
| Efficient Analysis of VASS Termination Complexity | 2021-01-21 | Paper |
| Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS | 2021-01-20 | Paper |
| Black Ninjas in the Dark | 2021-01-20 | Paper |
| Deciding Fast Termination for Probabilistic VASS with Nondeterminism | 2020-07-20 | Paper |
| Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms | 2019-09-17 | 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 |
| A generic framework for checking semantic equivalences between pushdown automata and finite-state automata | 2017-10-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 |
| Trading performance for stability in Markov decision processes | 2016-11-14 | Paper |
| Regularity of normed PA processes | 2016-06-16 | Paper |
| Cobra: A Tool for Solving General Deductive Games | 2016-01-12 | Paper |
| On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS | 2015-09-29 | Paper |
| Efficient Analysis of Probabilistic Programs with an Unbounded Counter | 2015-08-14 | 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 |
| Methods for quantitative analysis of probabilistic pushdown automata | 2013-10-07 | 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 |
| Playing Games with Counter Automata | 2013-01-07 | 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 |
| Stochastic game logic | 2012-10-15 | Paper |
| Qualitative Reachability in Stochastic BPA Games | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224096 | 2012-03-29 | Paper |
| Qualitative reachability in stochastic BPA games | 2011-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172531 | 2011-10-05 | 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 |
| Equivalence-Checking with Infinite-State Systems: Techniques and Results | 2011-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3060981 | 2010-12-13 | Paper |
| Reachability Games on Extended Vector Addition Systems with States | 2010-09-07 | Paper |
| Stochastic Real-Time Games with Qualitative Timed Automata Objectives | 2010-08-31 | Paper |
| On the complexity of checking semantic equivalences between pushdown processes and finite-state processes | 2010-08-18 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Discounted Properties of Probabilistic Pushdown Automata | 2009-01-27 | 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 |
| On the controller synthesis for finite-state Markov decision processes | 2008-03-19 | Paper |
| Model Checking Probabilistic Pushdown Automata | 2007-10-11 | Paper |
| Reachability in Recursive Markov Decision Processes | 2007-09-04 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| A general approach to comparing infinite-state systems with their finite-state specifications | 2006-09-13 | Paper |
| Equivalence-checking on infinite-state systems: Techniques and results | 2006-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5714447 | 2006-01-02 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| The stuttering principle revisited | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673421 | 2005-04-29 | Paper |
| Model checking LTL with regular valuations for pushdown systems | 2004-11-23 | Paper |
| DP lower bounds for equivalence-checking and model-checking of one-counter automata | 2004-11-23 | Paper |
| A Logical Viewpoint on Process-algebraic Quotients | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738225 | 2004-08-11 | Paper |
| The complexity of bisimilarity-checking for one-counter processes. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411829 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708592 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484513 | 2003-06-12 | Paper |
| Simulation preorder over simple process algebras | 2003-01-14 | Paper |
| On finite representations of infinite-state behaviours | 2002-07-25 | Paper |
| Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766532 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754154 | 2001-11-11 | Paper |
| Deciding bisimulation-like equivalences with finite-state processes | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501545 | 2000-09-04 | Paper |
| Effective decomposability of sequential behaviours | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945247 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270070 | 1999-12-20 | Paper |
| Comparing expressibility of normed BPA and normed BPP processes | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223069 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222869 | 1998-12-20 | Paper |
