| Publication | Date of Publication | Type |
|---|
| Solvability of orbit-finite systems of linear equations | 2024-12-06 | Paper |
| On the semantics of multistage interconnection networks | 2024-06-21 | Paper |
| Improved Ackermannian lower bound for the Petri nets reachability problem | 2024-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187070 | 2024-02-05 | Paper |
| The Reachability Problem for Petri Nets Is Not Elementary | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094137 | 2022-08-02 | Paper |
| New pumping technique for 2-dimensional VASS | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089309 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089315 | 2022-07-18 | Paper |
| Nondeterministic and co-nondeterministic implies deterministic, for data languages | 2021-10-18 | Paper |
| Regular separability of well-structured transition systems | 2021-08-04 | Paper |
| Linear equations with ordered data | 2021-08-04 | Paper |
| Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms | 2021-07-28 | Paper |
| Partially-commutative context-free languages | 2021-04-27 | Paper |
| A lower bound for the coverability problem in acyclic pushdown VAS | 2021-03-11 | Paper |
| Relating timed and register automata | 2021-02-24 | Paper |
| Reachability relations of timed pushdown automata | 2021-02-02 | Paper |
| Timed pushdown automata and branching vector addition systems | 2021-01-19 | Paper |
| Regular separability of one counter automata | 2021-01-19 | Paper |
| WQO dichotomy for 3-graphs | 2020-12-15 | Paper |
| Regular separability of Parikh automata | 2020-05-27 | Paper |
| The reachability problem for Petri nets is not elementary | 2020-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207051 | 2020-01-03 | Paper |
| Binary reachability of timed-register pushdown automata and branching vector addition systems | 2019-11-22 | Paper |
| Regular separability of one counter automata | 2019-07-12 | Paper |
| WQO dichotomy for 3-graphs | 2018-07-17 | Paper |
| Timed Pushdown Automata Revisited | 2018-04-23 | Paper |
| Turing machines with atoms, constraint satisfaction problems, and descriptive complexity | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636561 | 2018-04-19 | Paper |
| Separability of reachability sets of vector addition systems | 2018-04-19 | Paper |
| Reachability analysis of first-order definable pushdown systems | 2017-08-31 | Paper |
| Alternating timed automata | 2017-07-12 | Paper |
| Turing machines with atoms | 2017-07-03 | Paper |
| Relating timed and register automata | 2017-04-04 | Paper |
| Simulation over one-counter nets is PSPACE-complete | 2017-02-21 | Paper |
| Undecidability of performance equivalence of Petri nets | 2017-02-06 | Paper |
| Equivariant algorithms for constraint satisfaction problems over coset templates | 2016-11-23 | Paper |
| Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture | 2016-10-04 | Paper |
| Coverability trees for Petri nets with unordered data | 2016-06-10 | Paper |
| Simulation problems over one-counter nets | 2016-04-19 | Paper |
| Towards nominal computation | 2015-09-11 | Paper |
| Normed processes, unique decomposition, and complexity of bisimulation equivalences | 2015-03-19 | Paper |
| Decidability of branching bisimulation on normed commutative context-free processes | 2015-02-05 | Paper |
| Automata theory in nominal sets | 2014-09-05 | Paper |
| Causality versus true-concurrency | 2013-10-07 | Paper |
| Reachability problem for weak multi-pushdown automata | 2013-09-26 | Paper |
| Fraenkel-Mostowski sets with non-homogeneous atoms | 2013-01-07 | Paper |
| A Machine-Independent Characterization of Timed Languages | 2012-11-01 | Paper |
| Reachability problem for weak multi-pushdown automata | 2012-09-25 | Paper |
| Fast equivalence-checking for normed context-free processes | 2012-08-29 | Paper |
| An extension of data automata that captures XPath | 2012-04-03 | Paper |
| Decidability of branching bisimulation on normed commutative context-free processes | 2011-09-02 | Paper |
| Partially-commutative context-free processes: expressibility and tractability | 2011-05-04 | Paper |
| EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system | 2010-08-20 | Paper |
| Non-interleaving bisimulation equivalences on basic parallel processes | 2010-01-12 | Paper |
| Partially-Commutative Context-Free Processes | 2009-10-22 | Paper |
| Logical relations for monadic types | 2008-12-10 | Paper |
| Causality versus true-concurrency | 2007-12-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes | 2007-09-05 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| Decidability of performance equivalence for basic parallel processes | 2006-09-14 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472004 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411847 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484511 | 2003-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767007 | 2002-07-22 | Paper |
| Coalgebra morphisms subsume open maps | 2002-07-15 | Paper |
| On different models for packet flow in multistage interconnection networks | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247682 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256308 | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219023 | 1999-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839057 | 1998-10-26 | Paper |
