Workflow Trees for Representation and Mining of Implicitly Concurrent Business Processes

TR Image
A workflow tree corresponding to a WF-net that cannot be recovered by the α algorithm, if the auxiliary tasks &-s and &-j are missing from the workflow log.

We propose a novel representation of business processes called workflow trees that facilitates the mining of process models where the parallel execution of two or more sub-processes has not been recorded explicity in workflow logs. Based on the provable property of workflow trees that a pair of tasks are siblings in the tree if and only if they have identical respective workflow-log relations with each and every remaining third task in the process, we describe an efficient business process mining algorithm of complexity only cubic in the number of process tasks, and analyze the class of processes that can be identified and reconstructed by it.