13 citations · 14 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026★ 1 cited
Computational Complexity of Alignments
Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking t…
cs.FL2026
Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst
A central decision problem in Petri net theory is reachability asking whether a given marking can be reached from the initial marking. Related is the covering problem (or sub-marki…