TY - JOUR A1 - Weidlich, Matthias A1 - Ziekow, Holger A1 - Gal, Avigdor A1 - Mendling, Jan A1 - Weske, Mathias T1 - Optimizing event pattern matching using business process models JF - IEEE transactions on knowledge and data engineering N2 - A growing number of enterprises use complex event processing for monitoring and controlling their operations, while business process models are used to document working procedures. In this work, we propose a comprehensive method for complex event processing optimization using business process models. Our proposed method is based on the extraction of behaviorial constraints that are used, in turn, to rewrite patterns for event detection, and select and transform execution plans. We offer a set of rewriting rules that is shown to be complete with respect to the all, seq, and any patterns. The effectiveness of our method is demonstrated in an experimental evaluation with a large number of processes from an insurance company. We illustrate that the proposed optimization leads to significant savings in query processing. By integrating the optimization in state-of-the-art systems for event pattern matching, we demonstrate that these savings materialize in different technical infrastructures and can be combined with existing optimization techniques. KW - Event processing KW - query optimisation KW - query rewriting Y1 - 2014 U6 - https://doi.org/10.1109/TKDE.2014.2302306 SN - 1041-4347 SN - 1558-2191 VL - 26 IS - 11 SP - 2759 EP - 2773 PB - Inst. of Electr. and Electronics Engineers CY - Los Alamitos ER - TY - JOUR A1 - Polyvyanyy, Artem A1 - Garcia-Banuelos, Luciano A1 - Fahland, Dirk A1 - Weske, Mathias T1 - Maximal structuring of acyclic process models JF - The computer journal : a publication of the British Computer Society N2 - This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a behavioral equivalence notion that preserves the observed concurrency of tasks in equivalent process models. The article gives a full characterization of the subclass of acyclic process models that have no equivalent well-structured representation, but do have an equivalent maximally-structured one, as well as proposes a complete structuring method. Together with our previous results, this article completes the solution of the process model structuring problem for the class of acyclic process models. KW - process modeling KW - structured process model KW - maximal structuring KW - model transformation KW - fully concurrent bisimulation Y1 - 2014 U6 - https://doi.org/10.1093/comjnl/bxs126 SN - 0010-4620 SN - 1460-2067 VL - 57 IS - 1 SP - 12 EP - 35 PB - Oxford Univ. Press CY - Oxford ER - TY - JOUR A1 - Baier, Thomas A1 - Mendling, Jan A1 - Weske, Mathias T1 - Bridging abstraction layers in process mining JF - Information systems N2 - While the maturity of process mining algorithms increases and more process mining tools enter the market, process mining projects still face the problem of different levels of abstraction when comparing events with modeled business activities. Current approaches for event log abstraction try to abstract from the events in an automated way that does not capture the required domain knowledge to fit business activities. This can lead to misinterpretation of discovered process models. We developed an approach that aims to abstract an event log to the same abstraction level that is needed by the business. We use domain knowledge extracted from existing process documentation to semi-automatically match events and activities. Our abstraction approach is able to deal with n:m relations between events and activities and also supports concurrency. We evaluated our approach in two case studies with a German IT outsourcing company. (C) 2014 Elsevier Ltd. All rights reserved. KW - Process mining KW - Abstraction KW - Event mapping Y1 - 2014 U6 - https://doi.org/10.1016/j.is.2014.04.004 SN - 0306-4379 SN - 1873-6076 VL - 46 SP - 123 EP - 139 PB - Elsevier CY - Oxford ER -