| Target-Oriented Petri Net Synthesis | 0 | 0.34 | 2020 |
| Simultaneous Petri Net Synthesis | 0 | 0.34 | 2018 |
| Sufficient conditions for the marked graph realisability of labelled transition systems. | 0 | 0.34 | 2018 |
| A Geometric Characterisation of Event/State Separation. | 0 | 0.34 | 2018 |
| Reachability Graphs of Two-Transition Petri Nets. | 0 | 0.34 | 2017 |
| k-Bounded Petri Net Synthesis from Modal Transition Systems. | 1 | 0.37 | 2017 |
| Characterising Petri Net Solvable Binary Words. | 5 | 0.57 | 2016 |
| Model Checking Contest @ Petri Nets, Report on the 2013 edition. | 5 | 0.70 | 2013 |
| Structure Theory of Petri Nets. | 3 | 0.41 | 2013 |
| Report on the Model Checking Contest at Petri Nets 2011. | 16 | 0.68 | 2012 |
| Raw Report on the Model Checking Contest at Petri Nets 2012 | 6 | 0.63 | 2012 |
| Finding a witness path for non-liveness in free-choice nets | 0 | 0.34 | 2011 |
| Applying CEGAR to the petri net state equation | 8 | 0.52 | 2011 |
| Reachability Analysis via Net Structure. | 0 | 0.34 | 2010 |
| New algorithms for deciding the siphon-trap property | 8 | 0.47 | 2010 |
| The downward-closure of petri net languages | 15 | 0.62 | 2010 |
| Making Petri Nets Safe and Free of Internal Transitions | 6 | 0.65 | 2007 |
| Separability in conflict-free petri nets | 10 | 0.82 | 2006 |
| Infinity of Intermediate States Is Decidable for Petri Nets | 3 | 0.43 | 2004 |
| Eliminating Internal Behaviour in Petri Nets | 2 | 0.40 | 2004 |
| Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets | 7 | 0.54 | 2000 |
| A uniform approach to true-concurrency and interleaving semantics for Petri nets | 13 | 0.82 | 1998 |
| Algebraic Characterization of Petri Net Pomset Semantics | 6 | 0.55 | 1997 |
