| Publication | Date of Publication | Type |
|---|
| Approximating the value of energy-parity objectives in simple stochastic games | 2024-12-03 | Paper |
| Weak bisimulation and model checking for basic parallel processes | 2024-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134255 | 2023-08-21 | Paper |
| Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs | 2023-08-21 | Paper |
| Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games | 2023-07-11 | Paper |
| Model checking PA-processes | 2023-05-17 | Paper |
| Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs | 2023-03-22 | Paper |
| Strategy Complexity of Threshold Payoff with Applications to Optimal Expected Payoff | 2022-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092320 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089306 | 2022-07-18 | Paper |
| Strategy Complexity of Reachability in Countable Stochastic 2-Player Games | 2022-03-22 | Paper |
| Simple stochastic games with almost-sure energy-parity objectives are in NP and conp | 2021-10-18 | Paper |
| Universal safety for timed Petri nets is PSPACE-complete | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3388706 | 2021-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144678 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144681 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144646 | 2021-01-19 | Paper |
| Reduction of nondeterministic tree automata | 2019-09-17 | Paper |
| B\"uchi Objectives in Countable MDPs | 2019-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625701 | 2019-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4611376 | 2019-01-18 | Paper |
| Tableau methods for PA-processes | 2019-01-15 | Paper |
| Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces | 2018-07-03 | Paper |
| Infinite-state energy games | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608681 | 2018-03-21 | Paper |
| A generic framework for checking semantic equivalences between pushdown automata and finite-state automata | 2017-10-11 | Paper |
| Decidability of Weak Simulation on One-Counter Nets | 2017-07-03 | Paper |
| Branching-Time Model Checking Gap-Order Constraint Systems | 2017-03-16 | Paper |
| Simulation Over One-counter Nets is PSPACE-Complete | 2017-02-21 | Paper |
| Qualitative Analysis of VASS-Induced MDPs | 2016-06-10 | Paper |
| Simulation problems over one-counter nets | 2016-04-19 | Paper |
| Stochastic Parity Games on Lossy Channel Systems | 2015-01-15 | Paper |
| Advanced automata minimization | 2014-11-27 | Paper |
| Branching-Time Model Checking Gap-Order Constraint Systems | 2014-07-07 | Paper |
| Priced timed Petri nets | 2013-11-28 | Paper |
| Weak bisimilarity and regularity of context-free processes is EXPTIME-hard | 2013-09-09 | Paper |
| Solving Parity Games on Integer Vectors | 2013-08-12 | Paper |
| Advanced Ramsey-Based Büchi Automata Inclusion Testing | 2011-09-02 | Paper |
| Common intervals of multiple permutations | 2011-05-10 | Paper |
| Multipebble Simulations for Alternating Automata | 2010-08-31 | Paper |
| On the complexity of checking semantic equivalences between pushdown processes and finite-state processes | 2010-08-18 | Paper |
| When Simulation Meets Antichains | 2010-04-27 | Paper |
| Minimal Cost Reachability/Coverability in Priced Timed Petri Nets | 2009-03-31 | Paper |
| Eager Markov Chains | 2008-09-04 | Paper |
| Stochastic Games with Lossy Channels | 2008-04-11 | Paper |
| Decisive Markov Chains | 2008-04-01 | Paper |
| Model Checking Probabilistic Pushdown Automata | 2007-10-11 | Paper |
| Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness | 2007-10-11 | Paper |
| Model Checking Software | 2007-09-28 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673421 | 2005-04-29 | Paper |
| Weak bisimilarity and regularity of context-free processes is EXPTIME-hard | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449204 | 2004-02-08 | Paper |
| Undecidable problems in unreliable computations. | 2003-08-17 | Paper |
| Automatic verification of recursive procedures with one integer parameter. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708592 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484513 | 2003-06-12 | Paper |
| Process rewrite systems. | 2003-01-14 | Paper |
| Simulation preorder over simple process algebras | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785460 | 2003-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536443 | 2002-11-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/Q2754155 | 2001-11-11 | Paper |
| Deciding bisimulation-like equivalences with finite-state processes | 2001-08-20 | Paper |
| Decidability of model checking with the temporal logic EF | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508393 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270070 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251060 | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234763 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222920 | 1998-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222874 | 1998-12-20 | Paper |
| Higher-order rewrite systems and their confluence | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364400 | 1997-11-17 | Paper |
| Memoryless Strategies in Stochastic Reachability Games | N/A | Paper |
| "Strategy Complexity of B\""uchi Objectives in Concurrent Stochastic Games" | N/A | Paper |
