21 citations · 49 across the 5 of their papers we have counts for
5 papers
Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete
Uli Schlachter, Harro Wimmel
For a given labelled transition system (LTS), synthesis is the task to find an unlabelled Petri net with an isomorphic reachability graph. Even when just demanding an embedding int…
Synthesis of Reduced Asymmetric Choice Petri Nets
Harro Wimmel
A Petri net is choice-free if any place has at most one transition in its postset (consuming its tokens) and it is (extended) free-choice (EFC) if the postsets of any two places ar…
Model Checking Contest @ Petri Nets, Report on the 2013 edition
Fabrice Kordon, Alban Linard, Marco Beccuti +14
This document presents the results of the Model Checking Contest held at Petri Nets 2013 in Milano. This contest aimed at a fair and experimental evaluation of the performances of…
Applying CEGAR to the Petri Net State Equation
Karsten Wolf, Harro Wimmel
We propose a reachability verification technique that combines the Petri net state equation (a linear algebraic overapproximation of the set of reachable states) with the concept o…
Raw Report on the Model Checking Contest at Petri Nets 2012
F. Kordon, A. Linard, D. Buchs +11
This article presents the results of the Model Checking Contest held at Petri Nets 2012 in Hambourg. This contest aimed at a fair and experimental evaluation of the performances of…