| Publication | Date of Publication | Type |
|---|
| Petri Net Primer | 2024-03-11 | Paper |
| Articulation of Transition Systems and Its Application to Petri Net Synthesis | 2024-01-29 | Paper |
| On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets | 2023-11-23 | Paper |
| Petri boxes and finite precedence | 2023-06-28 | Paper |
| Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues | 2022-10-31 | Paper |
| Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues | 2022-10-31 | Paper |
| A New Property of Choice-Free Petri Net Systems | 2022-09-01 | Paper |
| Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues | 2022-08-19 | Paper |
| Synthesis of (choice-free) reset nets | 2022-03-21 | Paper |
| Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis | 2022-02-01 | Paper |
| Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond | 2021-06-14 | Paper |
| Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach | 2021-06-14 | Paper |
| Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks | 2021-05-20 | Paper |
| Target-oriented Petri Net Synthesis | 2021-05-20 | Paper |
| Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods | 2020-01-24 | Paper |
| Analysis and synthesis of weighted marked graph Petri nets | 2019-12-18 | Paper |
| Factorisation of Petri net solvable transition systems | 2019-12-18 | Paper |
| Simultaneous Petri Net Synthesis | 2019-02-08 | Paper |
| Bounded choice-free Petri net synthesis: algorithmic issues | 2018-10-09 | Paper |
| On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets | 2018-10-02 | Paper |
| On liveness and deadlockability in subclasses of weighted Petri nets | 2018-08-20 | Paper |
| Factorisation of transition systems | 2018-06-26 | Paper |
| Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata | 2018-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357699 | 2017-09-12 | Paper |
| A Graph-Theoretical Characterisation of State Separation | 2017-04-04 | Paper |
| Characterisation of the state spaces of marked graph Petri nets | 2017-03-16 | Paper |
| The Power of Prime Cycles | 2016-10-04 | Paper |
| Minimal Elements for the Prime Numbers | 2016-06-29 | Paper |
| Liu and Layland's schedulability test revisited | 2016-06-16 | Paper |
| Synthesis of Live and Bounded Persistent Systems | 2016-05-02 | Paper |
| State space axioms for T-systems | 2015-04-16 | Paper |
| Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters | 2015-03-19 | Paper |
| Synthesis and reengineering of persistent systems | 2015-03-02 | Paper |
| Synthesis of Persistent Systems | 2014-07-08 | Paper |
| Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852064 | 2013-10-07 | Paper |
| A Petri Net Interpretation of Open Reconfigurable Systems | 2013-04-18 | Paper |
| A Petri Net Interpretation of Open Reconfigurable Systems | 2011-06-29 | Paper |
| An Algebra of Non-safe Petri Boxes | 2011-05-06 | Paper |
| Boundedness undecidability for synchronized nets | 2010-01-29 | Paper |
| A Petri Net Translation of π-Calculus Terms | 2008-09-11 | Paper |
| A compositional Petri net translation of general \(\pi\)-calculus terms | 2008-08-21 | Paper |
| Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets | 2008-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480176 | 2006-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472874 | 2006-06-19 | Paper |
| Formal Techniques for Networked and Distributed Systems – FORTE 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461748 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436360 | 2003-12-04 | Paper |
| General parameterised refinement and recursion for the M-net calculus | 2003-07-30 | Paper |
| The box algebra = Petri nets + process expressions | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760251 | 2001-12-18 | Paper |
| Recursion and Petri nets | 2001-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500366 | 2000-09-04 | Paper |
| Petri net algebra | 2000-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948013 | 2000-06-21 | Paper |
| S-invariant analysis of general recursive Petri boxes | 1995-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281515 | 1994-04-07 | Paper |
| Equality of agent expressions is preserved under an extension of the universe of actions | 1993-06-29 | Paper |
| Maximality preserving bisimulation | 1992-09-27 | Paper |
| Concurrent bisimulations in Petri nets | 1991-01-01 | Paper |
| Sequential and concurrent behaviour in Petri net theory | 1987-01-01 | Paper |
| Concurrent and maximally concurrent evolution of nonsequential systems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680255 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683545 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875334 | 1980-01-01 | Paper |
| Hashing techniques, a global approach | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144165 | 1977-01-01 | Paper |
| Game interpretation of the deadlock avoidance problem | 1977-01-01 | Paper |
| Improvement of parallelism in a finite buffer sharing policy | 1976-01-01 | Paper |
| Realization of Petri nets without conditional statements | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5183051 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5567486 | 1968-01-01 | Paper |
