| Publication | Date of Publication | Type |
|---|
| On Arch Factorization and Subword Universality for Words and Compressed Words | 2023-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992528 | 2021-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144688 | 2021-01-19 | Paper |
| On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders | 2020-07-08 | Paper |
| The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings | 2020-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207052 | 2020-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376657 | 2019-05-17 | Paper |
| On shuffle products, acyclic automata and piecewise-testable languages | 2019-03-11 | Paper |
| The Height of Piecewise-Testable Languages with Applications in Logical Complexity | 2017-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278312 | 2017-07-13 | Paper |
| Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties | 2017-07-12 | Paper |
| The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets | 2017-05-16 | Paper |
| On the state complexity of closures and interiors of regular languages with subwords and superwords | 2015-12-10 | Paper |
| On Functions Weakly Computable by Petri Nets and Vector Addition Systems | 2015-10-28 | Paper |
| Generalized Post embedding problems | 2015-07-20 | Paper |
| On Reachability for Unidirectional Channel Systems Extended with Regular Tests | 2015-04-22 | Paper |
| On the index of Simon's congruence for piecewise testability | 2015-01-30 | Paper |
| The Power of Priority Channel Systems | 2015-01-15 | Paper |
| On the State Complexity of Closures and Interiors of Regular Languages with Subwords | 2014-08-07 | Paper |
| A short visit to the STS hierarchy | 2013-10-07 | Paper |
| The Power of Well-Structured Systems | 2013-08-12 | Paper |
| The Power of Priority Channel Systems | 2013-08-12 | Paper |
| An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems | 2013-04-26 | Paper |
| On termination and invariance for faulty channel machines | 2013-03-22 | Paper |
| On Termination for Faulty Channel Machines | 2013-03-19 | Paper |
| Unidirectional Channel Systems Can Be Tested | 2012-09-21 | Paper |
| Generalized Post embedding problems | 2012-09-10 | Paper |
| On Solving Temporal Logic Queries | 2011-05-06 | Paper |
| Pumping and Counting on the Regular Post Embedding Problem | 2010-09-07 | Paper |
| Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets | 2010-09-03 | Paper |
| Lossy Counter Machines Decidability Cheat Sheet | 2010-08-31 | Paper |
| Computing Blocker Sets for the Regular Post Embedding Problem | 2010-08-31 | Paper |
| Toward a Compositional Theory of Leftist Grammars and Transformations | 2010-04-27 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| A note on the attractor-property of infinite-state Markov chains | 2009-12-18 | Paper |
| Mu-calculus path checking | 2009-12-18 | Paper |
| Validation of Stochastic Systems | 2009-07-24 | Paper |
| A PTIME-complete matching problem for SLP-compressed words | 2009-07-21 | Paper |
| Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness | 2009-03-11 | Paper |
| Mixing Lossy and Perfect Fifo Channels | 2008-11-25 | Paper |
| On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems | 2008-05-27 | Paper |
| Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems | 2008-04-24 | Paper |
| The ω-Regular Post Embedding Problem | 2008-04-11 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
| A general approach to comparing infinite-state systems with their finite-state specifications | 2006-09-13 | Paper |
| \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) | 2006-08-16 | Paper |
| Decidable first-order transition logics for PA-processes | 2005-12-07 | Paper |
| Verification of probabilistic systems with faulty communication | 2005-11-22 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems | 2005-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738231 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736876 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449220 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150206 | 2003-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417855 | 2003-07-30 | Paper |
| The complexity of propositional linear temporal logics in simple cases | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766577 | 2002-06-17 | Paper |
| The regular viewpoint on PA-processes | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771058 | 2002-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754156 | 2001-11-11 | Paper |
| Well-structured transition systems everywhere! | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2733893 | 2001-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508291 | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511269 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508303 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938633 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251913 | 1999-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381382 | 1999-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222919 | 1998-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219024 | 1998-11-15 | Paper |
| A rewrite-based type discipline for a subset of computer algebra | 1992-06-25 | Paper |
