Algebraic Characterization of Petri Net Pomset Semantics. - Harro Wimmel; Lutz Priese (CONCUR, 1997)

A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. - Lutz Priese; Harro Wimmel (Theor. Comput. Sci., 1998)

Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. - Eike Best; Harro Wimmel (ICATPN, 2000)

Eliminating Internal Behaviour in Petri Nets. - Harro Wimmel (ICATPN, 2004)

Infinity of Intermediate States Is Decidable for Petri Nets. - Harro Wimmel (ICATPN, 2004)

Separability in Conflict-Free Petri Nets. - Eike Best; Javier Esparza; Harro Wimmel; Karsten Wolf (Ershov Memorial Conference, 2006)

Making Petri Nets Safe and Free of Internal Transitions. - Eike Best; Philippe Darondeau; Harro Wimmel (Fundam. Informaticae, 2007)

New Algorithms for Deciding the Siphon-Trap Property. - Olivia Oanea; Harro Wimmel; Karsten Wolf (Petri Nets, 2010)

Optimised Calculation of Symmetries for State Space Reduction. - Harro Wimmel (AWPN, 2010)

Reachability Analysis via Net Structure. - Harro Wimmel; Karsten Wolf (AWPN, 2010)

The Downward-Closure of Petri Net Languages. - Peter Habermehl; Roland Meyer 001; Harro Wimmel (ICALP (2), 2010)

Finding a Witness Path for Non-liveness in Free-Choice Nets. - Harro Wimmel; Karsten Wolf (Petri Nets, 2011)

Applying CEGAR to the Petri Net State Equation - Harro Wimmel; Karsten Wolf (Log. Methods Comput. Sci., 2012)

Raw Report on the Model Checking Contest at Petri Nets 2012 - Fabrice Kordon; Alban Linard; Didier Buchs; Maximilien Colange; Sami Evangelista; Lukasz Fronc; Lom-Messan Hillah; Niels Lohmann; Emmanuel Paviot-Adet; Franck Pommereau; Christian Rohr; Yann Thierry-Mieg; et al. (CoRR, 2012)

Report on the Model Checking Contest at Petri Nets 2011. - Fabrice Kordon; Alban Linard; Didier Buchs; Maximilien Colange; Sami Evangelista; Kai Lampka; Niels Lohmann; Emmanuel Paviot-Adet; Yann Thierry-Mieg; Harro Wimmel (Trans. Petri Nets Other Model. Concurr., 2012)

Model Checking Contest @ Petri Nets, Report on the 2013 edition. - Fabrice Kordon; Alban Linard; Marco Beccuti; Didier Buchs; Lukasz Fronc; Lom-Messan Hillah; Francis Hulin-Hubard; Fabrice Legond-Aubry; Niels Lohmann; Alexis Marechal; Emmanuel Paviot-Adet; Franck Pommereau; et al. (CoRR, 2013)

Structure Theory of Petri Nets. - Eike Best; Harro Wimmel (Trans. Petri Nets Other Model. Concurr., 2013)

Characterising Petri Net Solvable Binary Words. - Eike Best; Evgeny Erofeev; Uli Schlachter; Harro Wimmel (Petri Nets, 2016)

Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. - Eike Best; Harro Wimmel (RP, 2016)

Reachability Graphs of Two-Transition Petri Nets. - Evgeny Erofeev; Harro Wimmel (ATAED@Petri Nets/ACSD, 2017)

k-Bounded Petri Net Synthesis from Modal Transition Systems. - Uli Schlachter; Harro Wimmel (CONCUR, 2017)

A Geometric Characterisation of Event/State Separation. - Uli Schlachter; Harro Wimmel (Petri Nets, 2018)

Simultaneous Petri Net Synthesis. - Eike Best; Raymond Devillers; Uli Schlachter; Harro Wimmel (Sci. Ann. Comput. Sci., 2018)

Sufficient conditions for the marked graph realisability of labelled transition systems. - Eike Best; Thomas Hujsa; Harro Wimmel (Theor. Comput. Sci., 2018)

Synthesis of Reduced Asymmetric Choice Petri Nets. - Harro Wimmel (CoRR, 2019)

Relabelling LTS for Petri Net Synthesis via Solving Separation Problems. - Uli Schlachter; Harro Wimmel (Trans. Petri Nets Other Model. Concurr., 2019)

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete. - Uli Schlachter; Harro Wimmel (CoRR, 2020)

Target-oriented Petri Net Synthesis. - Eike Best; Raymond Devillers; Evgeny Erofeev; Harro Wimmel (Fundam. Informaticae, 2020)

Presynthesis of bounded choice-free or fork-attribution nets. - Harro Wimmel (Inf. Comput., 2020)