A Logic Petri Net-Based Method for Repairing Process Models With Concurrent Blocks
Business processes are usually described and verified by the process models before they are implemented in the information systems. However, there exist deviations between the activities of a process model and those in event logs generated from the information systems. To replay the activities in the logs, the existing model needs to be repaired. In the current repair methods, the models with concurrent blocks cannot be simply repaired. Therefore, this paper proposes a new model repair approach based on logic Petri nets. Concurrent transition pairs and choice transition pairs are constructed based on process trees. By traversing optimal alignments, the transitions between the head and tail of concurrent blocks are determined, deviations are used to judge whether the activities in a process model and event logs have concurrent transition pairs or choice transition pairs, and the model is then repaired via logic Petri nets. Finally, the correctness and effectiveness of the proposed model repair method are illustrated by the experiments..
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2019 |
|---|---|
| Erschienen: |
2019 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:7 |
|---|---|
| Enthalten in: |
IEEE Access - 7(2019), Seite 8266-8282 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Yuanxiu Teng [VerfasserIn] |
|---|
| Links: |
doi.org [kostenfrei] |
|---|
| Themen: |
Alignment |
|---|
| doi: |
10.1109/ACCESS.2018.2890070 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
DOAJ056679645 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | DOAJ056679645 | ||
| 003 | DE-627 | ||
| 005 | 20230502151139.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 230227s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1109/ACCESS.2018.2890070 |2 doi | |
| 035 | |a (DE-627)DOAJ056679645 | ||
| 035 | |a (DE-599)DOAJ06892b945725400fa9d53336eab8aeb1 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 050 | 0 | |a TK1-9971 | |
| 100 | 0 | |a Yuanxiu Teng |e verfasserin |4 aut | |
| 245 | 1 | 2 | |a A Logic Petri Net-Based Method for Repairing Process Models With Concurrent Blocks |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Business processes are usually described and verified by the process models before they are implemented in the information systems. However, there exist deviations between the activities of a process model and those in event logs generated from the information systems. To replay the activities in the logs, the existing model needs to be repaired. In the current repair methods, the models with concurrent blocks cannot be simply repaired. Therefore, this paper proposes a new model repair approach based on logic Petri nets. Concurrent transition pairs and choice transition pairs are constructed based on process trees. By traversing optimal alignments, the transitions between the head and tail of concurrent blocks are determined, deviations are used to judge whether the activities in a process model and event logs have concurrent transition pairs or choice transition pairs, and the model is then repaired via logic Petri nets. Finally, the correctness and effectiveness of the proposed model repair method are illustrated by the experiments. | ||
| 650 | 4 | |a Process model | |
| 650 | 4 | |a model repair | |
| 650 | 4 | |a logic Petri net | |
| 650 | 4 | |a process tree | |
| 650 | 4 | |a alignment | |
| 653 | 0 | |a Electrical engineering. Electronics. Nuclear engineering | |
| 700 | 0 | |a Yuyue Du |e verfasserin |4 aut | |
| 700 | 0 | |a Liang Qi |e verfasserin |4 aut | |
| 700 | 0 | |a Wenjing Luan |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i In |t IEEE Access |d IEEE, 2014 |g 7(2019), Seite 8266-8282 |w (DE-627)DOAJ000052264 |x 21693536 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:2019 |g pages:8266-8282 |
| 856 | 4 | 0 | |u https://doi.org/10.1109/ACCESS.2018.2890070 |z kostenfrei |
| 856 | 4 | 0 | |u https://doaj.org/article/06892b945725400fa9d53336eab8aeb1 |z kostenfrei |
| 856 | 4 | 0 | |u https://ieeexplore.ieee.org/document/8594542/ |z kostenfrei |
| 856 | 4 | 2 | |u https://doaj.org/toc/2169-3536 |y Journal toc |z kostenfrei |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_DOAJ | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 2019 |h 8266-8282 | ||