| Publication | Date of Publication | Type |
|---|
| Dualities between nets and automata induced by schizophrenic objects | 2022-12-16 | Paper |
| Stratified petri nets | 2022-12-09 | Paper |
| Polynomial algorithms for the synthesis of bounded nets | 2022-08-18 | Paper |
| Context-free event domains are recognizable | 2022-08-16 | Paper |
| Supervisory Control for Opacity | 2017-08-25 | Paper |
| Petri net synthesis | 2015-12-16 | Paper |
| Petri Net Distributability | 2015-12-07 | Paper |
| Enforcing opacity of regular predicates on modal transition systems | 2015-06-12 | Paper |
| Distributed Control of Discrete-Event Systems: A First Step | 2013-03-13 | Paper |
| Petri Net Reachability Graphs: Decidability Status of First Order Properties | 2012-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911619 | 2012-08-31 | Paper |
| Deciding Selective Declassification of Petri Nets | 2012-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3225713 | 2012-03-22 | Paper |
| Assembling Sessions | 2011-10-07 | Paper |
| Quasi-static scheduling of communicating tasks | 2010-10-07 | Paper |
| Separability in Persistent Petri Nets | 2010-06-22 | Paper |
| Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets | 2009-12-04 | Paper |
| Synthesis of Nets with Step Firing Policies | 2009-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5190771 | 2009-07-27 | Paper |
| A decomposition theorem for finite persistent transition systems | 2009-05-08 | Paper |
| Quasi-Static Scheduling of Communicating Tasks | 2008-11-25 | Paper |
| Decomposition Theorems for Bounded Persistent Petri Nets | 2008-07-03 | Paper |
| Synthesis of Nets with Step Firing Policies | 2008-07-03 | Paper |
| On the Synthesis of Zero-Safe Nets | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504339 | 2008-06-11 | Paper |
| Products of Message Sequence Charts | 2008-04-11 | Paper |
| Concurrent secrets | 2008-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431913 | 2008-01-02 | Paper |
| Lectures on Concurrency and Petri Nets | 2005-12-23 | Paper |
| Transition systems without transitions | 2005-06-30 | Paper |
| The synthesis of Petri nets from path-automatic specifications | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4421727 | 2003-09-01 | Paper |
| Linear control of live marked graphs | 2003-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152842 | 2003-03-20 | Paper |
| Distributing finite automata through Petri net synthesis | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766548 | 2002-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532079 | 2002-05-28 | Paper |
| On the Petri net realization of context-free graphs | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251924 | 1999-06-17 | Paper |
| Context-free event domains are recognizable | 1999-05-03 | Paper |
| The synthesis problem for elementary net systems is NP-complete | 1998-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247291 | 1998-01-01 | Paper |
| Trace nets and process automata | 1996-02-13 | Paper |
| Refinement of actions in event structures and causal trees | 1993-12-06 | Paper |
| Proof systems for infinite behaviours | 1992-09-27 | Paper |
| Fairness, distances and degrees | 1992-09-27 | Paper |
| On guarded recursion | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750408 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348429 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359754 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721642 | 1987-01-01 | Paper |
| About fair asynchrony | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678656 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700807 | 1985-01-01 | Paper |
