| Publication | Date of Publication | Type |
|---|
| Introducing divergence for infinite probabilistic models | 2024-10-23 | Paper |
| Branch-well-structured transition systems and extensions | 2024-06-27 | Paper |
| Avoiding state explosion by composition of minimal covering graphs | 2024-04-29 | Paper |
| Coverability and Termination in Recursive Petri Nets | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111454 | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134258 | 2023-08-21 | Paper |
| The Well Structured Problem for Presburger Counter Machines | 2023-02-03 | Paper |
| Verification of Flat FIFO Systems | 2023-02-03 | Paper |
| The Reachability Problem for Two-Dimensional Vector Addition Systems with States | 2022-12-08 | Paper |
| Branch-well-structured transition systems and extensions | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090970 | 2022-07-21 | Paper |
| Non axiomatisability of positive relation algebras with constants, via graph homomorphisms | 2022-07-18 | Paper |
| Property-directed verification and robustness certification of recurrent neural networks | 2022-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028474 | 2022-02-09 | Paper |
| Coverability, Termination, and Finiteness in Recursive Petri Nets | 2022-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020648 | 2022-01-06 | Paper |
| Commodification of accelerations for the Karp and Miller construction | 2021-12-09 | Paper |
| Forward analysis for WSTS, part I: completions | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136306 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5129947 | 2020-11-03 | Paper |
| Minimal coverability tree construction made complete and efficient | 2020-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5114831 | 2020-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111454 | 2020-05-27 | Paper |
| Approaching the coverability problem continuously | 2019-09-17 | Paper |
| Parameterized verification of monotone information systems | 2018-10-23 | Paper |
| Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete | 2018-04-23 | Paper |
| The ideal theory for WSTS | 2018-03-26 | Paper |
| Handling infinitely branching well-structured transition systems | 2017-12-20 | Paper |
| The Logical View on Continuous Petri Nets | 2017-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5367063 | 2017-10-12 | Paper |
| Extending the Rackoff technique to Affine nets | 2017-01-26 | Paper |
| Forward analysis and model checking for trace bounded WSTS | 2016-06-03 | Paper |
| Bounded Parikh automata | 2016-03-01 | Paper |
| Reachability in Timed Counter Systems | 2015-03-19 | Paper |
| Automatic Verification of Counter Systems With Ranking Function | 2015-03-19 | Paper |
| UNAMBIGUOUS CONSTRAINED AUTOMATA | 2014-08-04 | Paper |
| Handling Infinitely Branching WSTS | 2014-07-01 | Paper |
| About \textsc{Fast} and \textsc{TReX} accelerations | 2013-09-26 | Paper |
| On the \(\omega\)-language expressive power of extended Petri nets | 2013-09-25 | Paper |
| Reachability in Register Machines with Polynomial Updates | 2013-09-20 | Paper |
| Monotonic extensions of Petri nets: forward and backward search revisited | 2013-08-16 | Paper |
| Bounded Parikh automata | 2013-07-30 | Paper |
| Ordinal theory for expressiveness of well-structured transition systems | 2013-06-06 | Paper |
| Affine Parikh automata | 2012-11-22 | Paper |
| Unambiguous Constrained Automata | 2012-11-02 | Paper |
| Forward Analysis for WSTS, Part II: Complete WSTS | 2012-10-22 | Paper |
| The Theory of WSTS: The Case of Complete WSTS | 2012-09-04 | Paper |
| Place-boundedness for vector addition systems with one zero-test | 2012-08-29 | Paper |
| Model-checking CTL* over flat Presburger counter systems | 2012-07-17 | Paper |
| Model checking vector addition systems with one zero-test | 2012-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389997 | 2012-04-24 | Paper |
| Forward Analysis and Model Checking for Trace Bounded WSTS | 2011-06-29 | Paper |
| Ordinal Theory for Expressiveness of Well Structured Transition Systems | 2011-05-19 | Paper |
| Mixing Coverability and Reachability to Analyze VASS with One Zero-Test | 2010-01-28 | Paper |
| The convex hull of a regular set of integer vectors is polyhedral and effectively computable | 2009-12-18 | Paper |
| Towards Model-Checking Programs with Lists | 2009-11-12 | Paper |
| Forward Analysis for WSTS, Part II: Complete WSTS | 2009-07-14 | Paper |
| Reversal-Bounded Counter Machines Revisited | 2009-02-03 | Paper |
| Towards a Model-Checker for Counter Systems | 2008-09-04 | Paper |
| An efficient automata approach to some problems on context-free grammars. | 2008-06-27 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Model Checking Software | 2007-09-28 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
| Verification of programs with half-duplex communication | 2005-11-22 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| A well-structured framework for analysing Petri net extensions | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044342 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430283 | 2003-10-20 | Paper |
| Well-abstracted transition systems: Application to FIFO automata. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415251 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536629 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536371 | 2002-10-07 | 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/Q4527145 | 2001-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501546 | 2001-01-29 | Paper |
| A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223064 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223067 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219024 | 1998-11-15 | Paper |
| Verifying identical communicating processes is undecidable | 1998-10-22 | Paper |
| Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture | 1997-12-03 | Paper |
| A polynomial algorithm for the membership problem with categorial grammars | 1997-02-27 | Paper |
| Unreliable channels are easier to verify than perfect channels | 1996-03-27 | Paper |
| Reduction and covering of infinite reachability trees | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730790 | 1988-01-01 | Paper |
| Fifo nets without order deadlock | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771630 | 1987-01-01 | Paper |
| An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets | 1985-01-01 | Paper |
| Une généralisation des théorèmes de Higman et de Simon aux mots infinis | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3330517 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3704895 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959437 | 1982-01-01 | Paper |
