| Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis. | 0 | 0.34 | 2016 |
| On Binary Words Being Petri Net Solvable. | 4 | 0.51 | 2015 |
| Structure Theory of Petri Nets. | 3 | 0.41 | 2013 |
| Unifying Equivalences for Timed Transition Systems. | 0 | 0.34 | 2012 |
| Process Algebra: A Petri-Net-Oriented Tutorial | 2 | 0.56 | 2003 |
| Applications and Theory of Petri Nets 2003, 24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003, Proceedings | 32 | 8.05 | 2003 |
| Weak and Strong Composition of High-Level Petri-Nets | 1 | 0.39 | 1999 |
| Generalised composition operations for high-level Petri nets | 1 | 0.36 | 1999 |
| The Box Algebra - A Model of Nets and Process Expressions | 5 | 0.50 | 1999 |
| Orthogonal Transformations for Coloured Petri Nets | 4 | 0.53 | 1997 |
| Partial Order and SOS Semantics for Linear Constraint Programs | 19 | 0.95 | 1997 |
| Refinement of Coloured Petri Nets | 5 | 0.50 | 1997 |
| Linear Constraint Systems as High-Level Nets | 1 | 0.40 | 1996 |
| Solving Recursive Net Equations | 10 | 0.91 | 1995 |
| Using net refinement to compute the fixpoint of a recursive | 0 | 0.34 | 1995 |
| Operational Semantics for the Petri Box Calculus | 20 | 1.37 | 1994 |
| B(PN)2 - a Basic Petri Net Programming Notation | 46 | 3.72 | 1993 |
| Compositional Process Semantics of Petri Boxes | 4 | 0.55 | 1993 |
| General Refinement and Recursion Operators for the Petri Box Calculus | 35 | 2.10 | 1993 |
| CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings | 36 | 7.90 | 1993 |
| Esprit Basic Research Action 3148 DEMON (design methods based on nets) | 0 | 0.34 | 1992 |
| Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets | 6 | 0.73 | 1991 |
| Partial Order Semantics of Concurrent Programs (Abstract) | 0 | 0.34 | 1990 |
| Formale Methoden zur Erstellung robuster Software | 0 | 0.34 | 1984 |
| Information Flow in Nets | 8 | 1.19 | 1981 |
| Proof of a Concurrent Program Finding Euler Paths | 1 | 0.96 | 1980 |
| A theorem on the characteristics of nonsequential processes | 15 | 15.82 | 1980 |
| Martierte Petrinetze und Sigma-Teilsysteme | 0 | 0.34 | 1975 |
| The Relative Strength of K-Density | 16 | 5.49 | 1975 |
