| Publication | Date of Publication | Type |
|---|
| Reachability in vector addition systems is primitive-recursive in fixed dimension | 2024-12-19 | Paper |
| New algorithms for combinations of objectives using separating automata | 2024-12-06 | Paper |
| Ackermannian completion of separators | 2024-10-30 | Paper |
| Lower bounds on the state complexity of population protocols | 2024-03-26 | Paper |
| State Complexity of Protocols with Leaders | 2024-03-26 | Paper |
| Lower bounds on the state complexity of population protocols | 2023-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875685 | 2023-02-03 | Paper |
| The Reachability Problem for Petri Nets Is Not Elementary | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090970 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092363 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089315 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089304 | 2022-07-18 | Paper |
| Flat Petri nets (invited talk) | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002821 | 2021-07-28 | Paper |
| A lower bound for the coverability problem in acyclic pushdown VAS | 2021-03-11 | Paper |
| When Reachability Meets Grzegorczyk | 2021-01-21 | Paper |
| Efficient Analysis of VASS Termination Complexity | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144611 | 2021-01-19 | Paper |
| Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One | 2020-05-27 | Paper |
| The reachability problem for Petri nets is not elementary | 2020-01-30 | Paper |
| Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States | 2020-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207052 | 2020-01-03 | Paper |
| Co-finiteness and co-emptiness of reachability sets in vector addition systems with states | 2019-12-18 | Paper |
| Occam's razor applied to the Petri net coverability problem | 2018-11-23 | Paper |
| Demystifying Reachability in Vector Addition Systems | 2018-04-23 | Paper |
| Hyper-Ackermannian bounds for pushdown vector addition systems | 2018-04-23 | Paper |
| Model Checking Population Protocols | 2018-04-19 | Paper |
| Occam's razor applied to the Petri net coverability problem | 2018-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601852 | 2018-01-24 | Paper |
| On boundedness problems for pushdown vector addition systems | 2017-10-27 | Paper |
| Verification of Population Protocols | 2017-09-12 | Paper |
| Presburger Vector Addition Systems | 2017-07-03 | Paper |
| On the Context-Freeness Problem for Vector Addition Systems | 2017-07-03 | Paper |
| Verification of population protocols | 2017-04-20 | Paper |
| Guiding Craig interpolation with domain-specific abstractions | 2016-06-28 | Paper |
| Coverability Trees for Petri Nets with Unordered Data | 2016-06-10 | Paper |
| The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems | 2015-12-17 | Paper |
| On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension | 2015-11-04 | Paper |
| On Functions Weakly Computable by Petri Nets and Vector Addition Systems | 2015-10-28 | Paper |
| Acceleration for Petri Nets | 2014-07-08 | Paper |
| Vector addition system reachability problem | 2014-04-10 | Paper |
| The affine hull of a binary automaton is computable in polynomial time | 2013-09-09 | Paper |
| A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness | 2013-08-12 | Paper |
| Vector Addition System Reversible Reachability Problem | 2013-04-09 | Paper |
| Reachability Analysis of Communicating Pushdown Systems | 2012-10-22 | Paper |
| Place-boundedness for vector addition systems with one zero-test | 2012-08-29 | Paper |
| Model checking vector addition systems with one zero-test | 2012-07-03 | Paper |
| Vector Addition System Reversible Reachability Problem | 2011-09-02 | Paper |
| Vector Addition System Reachability Problem: A Short Self-contained Proof | 2011-06-03 | Paper |
| Interpolating Quantifier-Free Presburger Arithmetic | 2010-10-12 | Paper |
| The general vector addition system reachability problem by Presburger inductive invariants | 2010-09-21 | Paper |
| Reachability Analysis of Communicating Pushdown Systems | 2010-04-27 | Paper |
| The convex hull of a regular set of integer vectors is polyhedral and effectively computable | 2009-12-18 | Paper |
| Polynomial Precise Interval Analysis Revisited | 2009-11-12 | Paper |
| A Generalization of Semenov’s Theorem to Automata over Real Numbers | 2009-07-28 | Paper |
| TaPAS: The Talence Presburger Arithmetic Suite | 2009-03-31 | Paper |
| Accelerated Data-Flow Analysis | 2009-03-03 | Paper |
| Structural Presburger digit vector automata | 2009-01-08 | Paper |
| Convex Hull of Arithmetic Automata | 2008-08-28 | Paper |
| Acceleration in Convex Data-Flow Analysis | 2008-04-24 | Paper |
| Accelerating Interpolation-Based Model-Checking | 2008-04-11 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Model Checking Software | 2007-09-28 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415251 | 2003-07-28 | Paper |
