Passages in graphs

Research output: Book/ReportReportAcademic

Abstract

Directed graphs can be partitioned in so-called passages. A passage P is a set of edges such that any two edges sharing the same initial vertex or sharing the same terminal vertex are both inside P or are both outside of P. Passages were first identified in the context of process mining where they are used to successfully decompose process discovery and conformance checking problems. In this article, we examine the properties of passages. We will show that passages are closed under set operators such as union, intersection and difference. Moreover, any passage is composed of so-called minimal passages. These properties can be exploited when decomposing graph-based analysis and computation problems.
Original languageEnglish
PublisherBPMcenter. org
Number of pages5
Publication statusPublished - 2012

Publication series

NameBPM reports
Volume1219

Fingerprint Dive into the research topics of 'Passages in graphs'. Together they form a unique fingerprint.

  • Cite this

    Aalst, van der, W. M. P. (2012). Passages in graphs. (BPM reports; Vol. 1219). BPMcenter. org.