The projected TAR and its application to conformance checking
| dc.contributor.author | Prescher, Johannes | |
| dc.contributor.author | Weidlich, Matthias | |
| dc.contributor.author | Mendling, Jan | |
| dc.contributor.editor | Rinderle-Ma, Stefanie | |
| dc.contributor.editor | Weske, Mathias | |
| dc.date.accessioned | 2018-11-06T10:45:10Z | |
| dc.date.available | 2018-11-06T10:45:10Z | |
| dc.date.issued | 2012 | |
| dc.description.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. | en |
| dc.identifier.isbn | 978-3-88579-600-8 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/17738 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | EMISA 2012 – Der Mensch im Zentrum der Modellierung | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-206 | |
| dc.title | The projected TAR and its application to conformance checking | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 164 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 151 | |
| gi.conference.date | 13.-14. September 2012 | |
| gi.conference.location | Wien, Österreich | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1