| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6168481 | 2023-08-08 | Paper |
| Structural Liveness of Immediate Observation Petri Nets | 2023-05-19 | Paper |
| Countdown games, and simulation on (succinct) one-counter nets | 2023-03-22 | Paper |
| Restarting automata | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5053759 | 2022-12-06 | Paper |
| Resource Bisimilarity in Petri Nets is Decidable | 2022-10-07 | Paper |
| High undecidability of weak bisimilarity for Petri nets | 2022-08-18 | Paper |
| Characterization of context-pree languages by erasing automata | 2022-08-18 | Paper |
| Decidability of weak fairness in petri nets | 2022-08-16 | Paper |
| Bisimilarity on basic parallel processes | 2022-02-01 | Paper |
| Equivalence of pushdown automata via first-order grammars | 2020-10-23 | Paper |
| Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence | 2020-02-24 | Paper |
| Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States | 2020-01-24 | Paper |
| State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI | 2020-01-03 | Paper |
| Co-finiteness and co-emptiness of reachability sets in vector addition systems with states | 2019-12-18 | Paper |
| Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable | 2019-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4558784 | 2018-11-30 | Paper |
| EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets | 2018-10-23 | Paper |
| Bisimulation equivalence is decidable for one-counter processes | 2018-07-04 | Paper |
| Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME | 2018-04-23 | Paper |
| Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4596795 | 2017-12-11 | Paper |
| On reachability-related games on vector addition systems with states | 2017-10-27 | Paper |
| Decidability of DPDA Language Equivalence via First-Order Grammars | 2017-05-16 | Paper |
| Deciding Structural Liveness of Petri Nets | 2017-04-04 | Paper |
| Bisimilarity of Probabilistic Pushdown Automata | 2017-01-26 | Paper |
| On Reachability for Unidirectional Channel Systems Extended with Regular Tests | 2015-04-22 | Paper |
| Equivalence of deterministic one-counter automata is NL-complete | 2014-08-07 | Paper |
| Language equivalence of probabilistic pushdown automata | 2014-07-18 | Paper |
| Bisimulation Equivalence of First-Order Grammars | 2014-07-01 | Paper |
| Equivalences of Pushdown Systems Are Hard | 2014-04-16 | Paper |
| Bisimulation equivalence and regularity for real-time one-counter automata | 2014-02-13 | Paper |
| Complexity of Checking Bisimilarity between Sequential and Parallel Processes | 2013-09-20 | Paper |
| Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof) | 2013-04-09 | Paper |
| Unidirectional Channel Systems Can Be Tested | 2012-09-21 | Paper |
| Equivalence-Checking with Infinite-State Systems: Techniques and Results | 2011-04-01 | Paper |
| Complexity of deciding bisimilarity between normed BPA and normed BPP | 2010-10-07 | Paper |
| Reachability Games on Extended Vector Addition Systems with States | 2010-09-07 | Paper |
| Bisimilarity of One-Counter Processes Is PSPACE-Complete | 2010-08-31 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| A note on emptiness for alternating finite automata with a one-letter alphabet | 2010-03-24 | Paper |
| Non-interleaving bisimulation equivalences on basic parallel processes | 2010-01-12 | Paper |
| Hardness of equivalence checking for composed finite-state systems | 2009-05-08 | Paper |
| Undecidability of bisimilarity by defender's forcing | 2008-12-21 | Paper |
| Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm | 2008-12-03 | Paper |
| Normed BPA vs. Normed BPP Revisited | 2008-11-25 | Paper |
| Selected Ideas Used for Decidability and Undecidability of Bisimilarity | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517257 | 2008-08-12 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424633 | 2007-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5486000 | 2006-09-06 | Paper |
| Equivalence-checking on infinite-state systems: Techniques and results | 2006-07-14 | Paper |
| Applications and Theory of Petri Nets 2005 | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673429 | 2005-04-29 | Paper |
| DP lower bounds for equivalence-checking and model-checking of one-counter automata | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818859 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738225 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474001 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436352 | 2003-12-04 | Paper |
| Decidability of bisimilarity for one-counter processes. | 2003-01-14 | Paper |
| A note on well quasi-orderings for powersets | 2002-07-25 | Paper |
| Nonprimitive recursive complexity and undecidability for Petri net equivalences | 2001-08-20 | Paper |
| Deciding bisimulation-like equivalences with finite-state processes | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501545 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496250 | 2000-08-13 | Paper |
| Petri nets and regular processes | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942620 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938633 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934755 | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270051 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260383 | 1999-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223069 | 1999-01-03 | Paper |
| Undecidability of bisimilarity for Petri nets and some related problems | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4884987 | 1996-08-21 | Paper |
| Forgetting automata and contex-free languages | 1995-11-19 | Paper |
| Completeness results for single-path Petri nets | 1994-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035241 | 1993-05-18 | Paper |
| Decidability of a temporal logic problem for Petri nets | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732129 | 1989-01-01 | Paper |
