Abstract

In order to improve the efficiency of conformance checking in business process management, a business alignment approach is presented based on transition systems between relation matrices and Petri nets. Firstly, a log-based relation matrix of the events is obtained according to the event log. Then, the events in the relation matrix are observed and the transitions in the model are firing, and the activities in the log and in the model are compared. Next, the states of the log and the model are recorded until no new state can be generated, so a transition system can be obtained which includes optimal alignments between the event log and the process model. Finally, two detailed algorithms are presented to obtain an optimal alignment and all optimal alignments between the trace and the model based on the given cost function, respectively. The availability and effectiveness of the proposed approach are proved theoretically.

Highlights

  • Business process management (BPM) aims to provide a unified modeling, running, and monitoring environment for business processes from information technology and management technology

  • Its main idea is as follows: 1 an event net is constructed based on the trace; 2 the product of the event net and the process net is generated, which is a Petri net; 3 part of the reachable graph of the product model is constructed while searching for the shortest path using A∗ algorithm, which is conformed to the definition of the transition system; 4 an optimal alignment can be obtained when arriving at the final state. e time and space complexity is very high in order to obtain the solutions

  • We can get an alignment transition system between the event log and the process model by Algorithm 1. e optimal alignments between the trace and model based on the standard likelihood cost function can be calculated through finding the shortest path from the initial state to the final state in the system. is section presents two algorithms to realize the calculations of an optimal alignment and all optimal alignments, respectively

Read more

Summary

Introduction

Business process management (BPM) aims to provide a unified modeling, running, and monitoring environment for business processes from information technology and management technology. A transition system can be obtained by comparing the events in the relation matrix with the activities in the Petri net, which includes all the alignments between all the traces and the process model. Its main idea is as follows: 1 an event net is constructed based on the trace; 2 the product of the event net and the process net is generated, which is a Petri net; 3 part of the reachable graph of the product model is constructed while searching for the shortest path using A∗ algorithm, which is conformed to the definition of the transition system; 4 an optimal alignment can be obtained when arriving at the final state. Γoσ,N,lc is the set of all optimal alignments between trace σ and model N based on the function lc()

Generation of Transition Systems
Calculation of Optimal Alignments
Scalability of Our Approach
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.