6 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.CC2020★ 6 cited
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…
cs.FL2019★ 4 cited
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…