| Publication | Date of Publication | Type |
|---|
| Branching in well-structured transition systems (invited talk) | 2026-03-23 | Paper |
| On the length of strongly monotone descending chains over \(\mathbb{N}^d\) | 2026-01-14 | Paper |
| Verifying unboundedness via amalgamation | 2025-06-18 | Paper |
| On the computation of the Zariski closure of finitely generated groups of matrices | 2025-01-17 | Paper |
| Reachability in vector addition systems is primitive-recursive in fixed dimension | 2024-12-19 | Paper |
| Bisimulation equivalence of first-order grammars is ACKERMANN-complete | 2024-12-19 | Paper |
| The Parametric Complexity of Lossy Counter Machines | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561320 (Why is no real title available?) | 2022-07-21 | Paper |
| On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices | 2021-06-03 | Paper |
The ideal view on Rackoff's coverability technique
Information and Computation | 2021-04-13 | Paper |
| Perfect half space games | 2021-01-19 | Paper |
Perfect half space games
(available as arXiv preprint) | 2021-01-19 | Paper |
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Trends in Logic | 2020-07-08 | Paper |
Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets
(available as arXiv preprint) | 2019-10-22 | Paper |
| A hypersequent calculus with clusters for linear frames | 2019-07-24 | Paper |
The complexity of diagnosability and opacity verification for Petri nets
Fundamenta Informaticae | 2018-10-02 | Paper |
| The complexity of diagnosability and opacity verification for Petri nets | 2018-08-20 | Paper |
Demystifying Reachability in Vector Addition Systems
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The complexity of coverability in \(\nu\)-Petri nets
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Non-elementary complexities for branching VASS, MELL, and extensions
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| Ideal decompositions for vector addition systems (invited talk) | 2018-01-24 | Paper |
| Deciding piecewise testable separability for regular tree languages | 2017-12-19 | Paper |
The ideal view on Rackoff's coverability technique
Lecture Notes in Computer Science | 2017-10-27 | Paper |
| A sequent calculus for a modal logic on finite data trees | 2017-07-19 | Paper |
Model-checking parse trees
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Complexity hierarchies beyond elementary
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Implicational relevance logic is 2-\textsc{ExpTime}-complete
Journal of Symbolic Logic | 2016-08-19 | Paper |
Coverability trees for Petri nets with unordered data
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Forward analysis and model checking for trace bounded WSTS
Theoretical Computer Science | 2016-06-03 | Paper |
Fixed-dimensional energy games are in pseudo-polynomial time
Automata, Languages, and Programming | 2015-11-04 | Paper |
Complexity bounds for ordinal-based termination (invited talk)
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Nonelementary complexities for branching VASS, MELL, and extensions
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
The power of priority channel systems
Logical Methods in Computer Science | 2015-01-15 | Paper |
Alternating vector addition systems with states
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Implicational Relevance Logic is 2-ExpTime-Complete
Lecture Notes in Computer Science | 2014-07-24 | Paper |
The power of well-structured systems
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The Power of Priority Channel Systems
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The parametric ordinal-recursive complexity of Post embedding problems
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Model Checking Coverability Graphs of Vector Addition Systems
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Forward analysis and model checking for trace bounded WSTS
Applications and Theory of Petri Nets | 2011-06-29 | Paper |
Parametric random generation of deterministic tree automata
Theoretical Computer Science | 2010-10-07 | Paper |
An experimental ambiguity detection tool
Science of Computer Programming | 2010-01-15 | Paper |
Random Generation of Deterministic Tree (Walking) Automata
Implementation and Application of Automata | 2009-07-09 | Paper |
Noncanonical LALR(1) Parsing
Developments in Language Theory | 2009-03-26 | Paper |
Conservative Ambiguity Detection in Context-Free Grammars
Automata, Languages and Programming | 2007-11-28 | Paper |
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time
Implementation and Application of Automata | 2007-09-06 | Paper |
