17 citations · 23 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.LO2015★ 17 cited
Analysis of Petri Nets and Transition Systems
Eike Best, Uli Schlachter
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri net…