| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5875635 | 2023-02-03 | Paper |
| The Reachability Problem for Petri Nets Is Not Elementary | 2022-12-08 | Paper |
| The Reachability Problem for Two-Dimensional Vector Addition Systems with States | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089315 | 2022-07-18 | Paper |
| Leafy automata for higher-order concurrency | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002806 | 2021-07-28 | Paper |
| When are emptiness and containment decidable for probabilistic automata? | 2021-04-14 | Paper |
| The ideal view on Rackoff's coverability technique | 2021-04-13 | Paper |
| A lower bound for the coverability problem in acyclic pushdown VAS | 2021-03-11 | Paper |
| A pseudo-quasi-polynomial algorithm for mean-payoff parity games | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144638 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144629 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144652 | 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 |
| Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems | 2019-11-22 | Paper |
| Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games | 2019-10-15 | Paper |
| The Complexity of Coverability in ν-Petri Nets | 2018-04-23 | Paper |
| Nonelementary Complexities for Branching VASS, MELL, and Extensions | 2018-04-23 | Paper |
| Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete | 2018-04-23 | Paper |
| What makes Petri nets harder to verify: stack or data? | 2018-03-26 | Paper |
| A polynomial-time algorithm for reachability in branching VASS in dimension one | 2017-12-19 | Paper |
| The ideal view on Rackoff's coverability technique | 2017-10-27 | Paper |
| Zeno, Hercules, and the Hydra | 2017-07-12 | Paper |
| Coverability Trees for Petri Nets with Unordered Data | 2016-06-10 | Paper |
| Contextual Approximation and Higher-Order Procedures | 2016-06-10 | Paper |
| Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time | 2015-11-04 | Paper |
| LTL with the freeze quantifier and register automata | 2015-09-17 | Paper |
| Alternating automata on data trees and XPath satisfiability | 2015-09-17 | Paper |
| Nonelementary Complexities for Branching VASS, MELL, and Extensions | 2015-09-17 | Paper |
| Safety alternating automata on data words | 2015-09-17 | Paper |
| Decidability of reachability for polymorphic systems with arrays: a complete classification | 2013-10-02 | Paper |
| Polymorphic systems with arrays, 2-counter machines and multiset rewriting | 2013-10-02 | Paper |
| Software model checking based on game semantics and CSP | 2013-09-26 | Paper |
| Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian | 2013-09-20 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2013-02-21 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2012-10-24 | Paper |
| The reachability problem for branching vector addition systems requires doubly-exponential space | 2012-03-27 | Paper |
| Model checking memoryful linear-time logics over one-counter automata | 2010-05-27 | Paper |
| Nets with Tokens Which Carry Data | 2009-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601861 | 2009-02-12 | Paper |
| Average-Price-per-Reward Games on Hybrid Automata with Strong Resets | 2009-02-10 | Paper |
| Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets | 2008-12-02 | Paper |
| Safely Freezing LTL | 2008-04-17 | Paper |
| Model Checking Freeze LTL over One-Counter Automata | 2008-04-11 | Paper |
| On the freeze quantifier in Constraint LTL: Decidability and complexity | 2007-02-19 | Paper |
| Static Analysis | 2006-10-31 | Paper |
| Communicating Sequential Processes. The First 25 Years | 2005-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457460 | 2004-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536630 | 2002-11-28 | Paper |
