PrefaceBusiness process modeling plays an important role in the management of business processes. As valuable design artifacts, business process models are subject to quality considerations. The absence of formal errors such as deadlocks is of paramount importance for the subsequent implementation of the process. This book develops a framework for the detection of formal errors in business process models and for the prediction of error probability based on quality attributes of these models (metrics). We focus on Event-driven Process Chains (EPCs), a widely used business process modeling language due to its extensive tool support. The advantage of this focus is firstly that the results of this book can be directly translated into process modeling practice. Secondly, there is a large empirical basis of models. By utilizing this large stock of EPC model collections, we aim to bring forth general insights into the connection between process model metrics and error probability. In order to validate such a connection, we first need to establish an understanding of which model attributes are likely connected with error probability. Furthermore, we must formally define an appropriate notion of correctness that answers the question of whether or not a model has a formal error. As a prerequisite to answering this question, we must define the operational semantics of the process modeling language formally.
ContributionsThis book presents a precise description of EPCs, their control-flow semantics and a suitable correctness criterion called EPC soundness. Furthermore, we identify theoretical arguments on why structural metrics should be connected with error probability and provide an empirical validation of this connection. To be more concise, this book provides the following technical contributions.Formalization of the OR-join: The semantics of the OR-join have been debated for more than a decade. Existing formalizations suffer from either a restriction of the EPC syntax (see [78,247,238,4,101]) or from non-intuitive behavior (see [325,218,11,465]). In Chap. 2, we formalize the EPC semantics concept as proposed elsewhere [267]. In comparison to other approaches this novel formalization has the advantage of not being restricted to a subset of EPCs. Moreover, VIII Preface it provides intuitive semantics for blocks of matching OR-splits and joins since they cannot deadlock. As a proof of concept, we implemented a plug-in for ProM that calculates the reachability graph. In this way, this novel semantics definition contributes to research on the specification of business process modeling languages. Verification of process models with OR-joins and multiple start and end events:Verification techniques for process models with OR-joins and multiple start and end events suffer from one of two problems: Firstly, they build on an approximation of the actual behavior, e.g., by considering a relaxed notion of soundness [101], by involving user decisions [109] or by approximating relaxed soundness with invariants [440]. Therefore, they d...