The Projected TAR and its Application to Conformance Checking
Lists
Only you see this
Abstract
Relational semantics of business process models have seen an uptake in various fields of application. As a prominent example, the Transition Adjacency Relation (TAR) has been used, for instance, to conduct conformance checking and similarity assessment. TAR is defined over the complete set of transitions of a Petri net and induces order dependencies between pairs of them. In this paper, we consider TAR in a more general setting, in which the order dependencies shall be derived only for a subset of projected transitions. We show how to derive this projected variant of TAR from the reachability graph of a reduced Petri net. We elaborate the projected TAR for conformance checking in a case from industry.
BibTeX
@inproceedings{prescher2012projected,
author = {Johannes Prescher and Jan Mendling and Matthias Weidlich},
title = {{The Projected TAR and its Application to Conformance Checking}},
booktitle = {EMISA},
year = {2012},
url = {https://openreview.net/forum?id=cUsTrv8SiO},
}Loading related content...