Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets. - Ernst W. Mayr; Jeremias Weihmann (Petri Nets, 2013)

Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities. - Ernst W. Mayr; Jeremias Weihmann (RP, 2013)

Inequalities for the Number of Walks in Graphs. - Hanjo Täubig; Jeremias Weihmann; Sven Kosub; Raymond Hemmecke; Ernst W. Mayr (Algorithmica, 2013)

A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application. - Ernst W. Mayr; Jeremias Weihmann (Petri Nets, 2014)

Matrix power inequalities and the number of walks in graphs. - Hanjo Täubig; Jeremias Weihmann (Discret. Appl. Math., 2014)

Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms. - Ernst W. Mayr; Jeremias Weihmann (Fundam. Informaticae, 2015)

Generalized Petri Nets: Algorithms and Complexity (Generalisierte Petrinetze: Algorithmen und Komplexität) - Jeremias Weihmann (2015)

Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities. - Ernst W. Mayr; Jeremias Weihmann (Fundam. Informaticae, 2016)