Диссертация (1137084), страница 42
Текст из файла (страница 42)
— P. 56.177. van der Aalst Wil M. P., Bolt Alfredo, van Zelst Sebastiaan J. RapidProM: Mine YourProcesses and Not Just Your Data // arXiv.org. — 2017.178. Scientific Workflows: Business as Usual? / B. Ludaescher, M. Weske, T. McPhillips, S. Bowers // Business Process Management (BPM 2009) / Ed. by U. Dayal, J. Eder, J. Koehler,H. Reijers. — Vol. 5701 of Lecture Notes in Computer Science. — Springer-Verlag, Berlin,2009.
— Pp. 31–47.179. Janssenswillen Gert, Depaire Benoı̂t. bupaR: Business Process Analysis in R // BPM (Demos). — Vol. 1920 of CEUR Workshop Proceedings. — CEUR-WS.org, 2017.180. van der Aalst W. M. P. A General Divide and Conquer Approach for Process Mining //Federated Conference on Computer Science and Information Systems (FedCSIS 2013) / Ed.by M. Ganzha, L.
Maciaszek, M. Paprzycki. — IEEE Computer Society, 2013. — Pp. 1–10.181. Pattern-oriented Software Architecture: A System of Patterns / Frank Buschmann, Regine Meunier, Hans Rohnert et al. — New York, NY, USA: John Wiley & Sons, Inc., 1996.182. Design Patterns: Elements of Reusable Object-Oriented Software / E. Gamma, R. Helm,R. Johnson, J. Vlissides. Professional Computing Series. — Addison Wesley, Reading, MA,USA, 1995.183183. van der Aalst Wil M. P. Decomposing Process Mining Problems Using Passages // Applications and Theory of Petri Nets 2012 / Ed. by S. Haddad, L.
Pomello. — Vol. 7347 of LectureNotes in Computer Science. — Springer-Verlag, Berlin, 2012. — Pp. 72–91.184. Lassen Kristian Bisgaard, van der Aalst Wil M. P. Complexity Metrics for Workflow Nets //Information and Software Technology. — 2009. — Vol. 51, no. 3. — Pp. 610–626.185.
Similarity of Business Process Models: Metrics and Evaluation / R. Dijkman, M. Dumas,B. F. van Dongen et al. // Information Systems. — 2011. — Vol. 36, no. 2. — Pp. 498–516.186. van der Aalst W. M. P., ter Hofstede A. H. M. YAWL: Yet Another Workflow Language //Information Systems. — 2005. — Vol. 30, no.
4. — Pp. 245–275.187. Jensen K. Coloured Petri Nets // Advances in Petri Nets 1986 Part I: Petri Nets, centralmodels and their properties / Ed. by W. Brauer, W. Reisig, G. Rozenberg. — Vol. 254 ofLecture Notes in Computer Science. — Springer-Verlag, Berlin, 1987. — Pp. 248–299.188. Christensen Søren, Hansen Niels Damgaard. Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs // Application and Theory of Petri Nets. — Vol.
691of Lecture Notes in Computer Science. — Springer, 1993. — Pp. 186–205.189. Lomazova Irina A. Nested Petri Nets — a Formalism for Specification and Verification ofMulti-Agent Distributed Systems // Fundam. Inform. — 2000. — Vol. 43, no. 1-4. — Pp. 195–214.190. Badouel Eric, Hélouët Loı̈c, Morvan Christophe. Petri Nets with Structured Data // Fundam.Inform. — 2016. — Vol. 146, no. 1. — Pp. 35–82.184List of Figures1Given process model . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .52Model discovered from scratch using the Inductive miner . . . . . . . . . . . . . . . .53Simple workflow net . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .104Modular repair scheme . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .135Maximal decomposition of the model from Figure 3 . . . . . . . . . . . . . . . . . . .156Process model from Figure 3 repaired using the naive technique . . . . . . . . . . . .167Neighbours are attached to the sub-net . . . . . . . . . . . . . . . . . . . . . . .
. . .168Process model repaired using the improved technique . . . . . . . . . . . . . . . . . .179Two types of inconsistencies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1810Non-local process model repair . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . .1911Example of the greedy model repair . . . . . . . . . . . . . . . . . . . . . . . . . . . .2012Scheme of the experimental evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . .2113Model from Figure 1 repaired using the improved technique . . . . . . . . . . . . . .2114Extra large model repaired using the greedy technique with Inductive miner . . . .221.1Petri net . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .241.2Simple workflow net . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .251.3Fragment of an event log in XES format . . . . . . . . . . . . . . . . . . . . . . . . . .281.4Process mining . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .291.5Process discovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .301.6Model discovered using -algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . .311.7Model discovered using ILP miner . . .
. . . . . . . . . . . . . . . . . . . . . . . . . .311.8Model discovered using Fuzzy miner . . . . . . . . . . . . . . . . . . . . . . . . . . . .321.9Model discovered using Heuristics miner . . . . . . . . . . . . . . . . . . . . . . . . . .321.10 Model discovered using Heuristics miner (see Figure 1.9) and transformed into aPetri net . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .321.11 Model discovered using Inductive miner . . . . . . . . . . . . . . . . . . . . . . . . . .331.12 Model visualized using Inductive visual miner . . . . . . . . . . . . . .
. . . . . . . .331.13 Conformance checking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .341.14 Flower workflow net . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .351.15 Two alignments (left: perfectly fitting; right: unfitting) . . . . . . . . . . .
. . . . . .371.16 Alignments projected on a Petri net to highlight fitness inconsistencies . . . . . . .381851.17 Process model repair . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .401.18 Initial process model . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . .411.19 Alignment for the unfitting trace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .411.20 Model repair technique of D. Fahland and W. van der Aalst [25]: basic repair . . .421.21 Model repair technique of D. Fahland and W. van der Aalst [25]: sub-processaddition .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .421.22 Genetic model improvement technique of J. Buijs et al. [109] . . . . . . . . . . . . . .442.1Modular scheme of the model repair technique . . . . . . . . . . . . . . . .
. . . . . .512.2Model of compensation requests handling . . . . . . . . . . . . . . . . . . . . . . . . .532.3Valid decomposition of the model from Figure 2.2 . . . . . . . . . . . . . . . . . . . .542.4Maximal decomposition of the model from Figure 2.2 . .
. . . . . . . . . . . . . . . .572.5Example of a maximal decomposition of the model with silent transitions andidentical transition labels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .582.6Fragments-to-repair selection . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . .602.7This model is discovered using Inductive miner . . . . . . . . . . . . . . . . . . . . . .602.8Petri net after transition fusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .612.9Workflow net with artificial and places . . . . . . . . . . . . . . . . . . .612.10 Petri net without redundant places . . .
. . . . . . . . . . . . . . . . . . . . . . . . . .622.11 Maximal decomposition of the model from Figure 2.2 . . . . . . . . . . . . . . . . . .632.12 Neighbours are attached to the sub-net . . . . . . . . . . . . . . . . . . . . . . . . . .642.13 Modular repair with the enlargement step . . . . .
. . . . . . . . . . . . . . . . . . . .662.14 Sub-net discovered to replace the enlarged fragment (3)′. . . . . . . . . . . .672.15 Petri net repaired using the improved approach . . . . . . . . . . . . . . . . . . . . .672.16 Two types of inconsistencies . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . .692.17 Non-local process model repair . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .702.18 Processing of the model with two unfitting fragments . . . . . . . . . . . . . . . . . .713.1Process simulation . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .753.2Example Petri net from Figure 1.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . .803.3Preferences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
