@article{WeidlichMendlingWeske2012, author = {Weidlich, Matthias and Mendling, Jan and Weske, Mathias}, title = {Propagating changes between aligned process models}, series = {The journal of systems and software}, volume = {85}, journal = {The journal of systems and software}, number = {8}, publisher = {Elsevier}, address = {New York}, issn = {0164-1212}, doi = {10.1016/j.jss.2012.02.044}, pages = {1885 -- 1898}, year = {2012}, abstract = {There is a wide variety of drivers for business process modelling initiatives, reaching from organisational redesign to the development of information systems. Consequently, a common business process is often captured in multiple models that overlap in content due to serving different purposes. Business process management aims at flexible adaptation to changing business needs. Hence, changes of business processes occur frequently and have to be incorporated in the respective process models. Once a process model is changed, related process models have to be updated accordingly, despite the fact that those process models may only be loosely coupled. In this article, we introduce an approach that supports change propagation between related process models. Given a change in one process model, we leverage the behavioural abstraction of behavioural profiles for corresponding activities in order to determine a change region in another model. Our approach is able to cope with changes in pairs of models that are not related by hierarchical refinement and show behavioural inconsistencies. We evaluate the applicability of our approach with two real-world process model collections. To this end, we either deduce change operations from different model revisions or rely on synthetic change operations.}, language = {en} } @article{DeckerWeske2011, author = {Decker, Gero and Weske, Mathias}, title = {Interaction-centric modeling of process choreographies}, series = {Information systems}, volume = {36}, journal = {Information systems}, number = {2}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2010.06.005}, pages = {292 -- 312}, year = {2011}, abstract = {With the rise of electronic integration between organizations, the need for a precise specification of interaction behavior increases. Information systems, replacing interaction previously carried out by humans via phone, faxes and emails, require a precise specification for handling all possible situations. Such interaction behavior is described in process choreographies. While many proposals for choreography languages have already been made, most of them fall into the category of interconnection models, where the observable behavior of the different partners is described and then related via message flow. As this article will show, this modeling approach fails to support fundamental design principles of choreographies and typically leads to modeling errors. This motivates an alternative modeling style, namely interaction modeling, for overcoming these limitations. While the main concepts are independent of a concrete modeling language, iBPMN is introduced as novel interaction modeling language. Formal execution semantics are provided and a comprehensive toolset implementing the approach is presented.}, language = {en} } @article{WeidlichDijkmanWeske2012, author = {Weidlich, Matthias and Dijkman, Remco and Weske, Mathias}, title = {Behaviour equivalence and compatibility of business process models with complex correspondences}, series = {The computer journal : a publication of the British Computer Society}, volume = {55}, journal = {The computer journal : a publication of the British Computer Society}, number = {11}, publisher = {Oxford Univ. Press}, address = {Oxford}, issn = {0010-4620}, doi = {10.1093/comjnl/bxs014}, pages = {1398 -- 1418}, year = {2012}, abstract = {Once multiple models of a business process are created for different purposes or to capture different variants, verification of behaviour equivalence or compatibility is needed. Equivalence verification ensures that two business process models specify the same behaviour. Since different process models are likely to differ with respect to their assumed level of abstraction and the actions that they take into account, equivalence notions have to cope with correspondences between sets of actions and actions that exist in one process but not in the other. In this paper, we present notions of equivalence and compatibility that can handle these problems. In essence, we present a notion of equivalence that works on correspondences between sets of actions rather than single actions. We then integrate our equivalence notion with work on behaviour inheritance that copes with actions that exist in one process but not in the other, leading to notions of behaviour compatibility. Compatibility notions verify that two models have the same behaviour with respect to the actions that they have in common. As such, our contribution is a collection of behaviour equivalence and compatibility notions that are applicable in more general settings than existing ones.}, language = {en} } @article{AwadWeidlichWeske2011, author = {Awad, Ahmed Mahmoud Hany Aly and Weidlich, Matthias and Weske, Mathias}, title = {Visually specifying compliance rules and explaining their violations for business processes}, series = {Journal of visual languages and computing}, volume = {22}, journal = {Journal of visual languages and computing}, number = {1}, publisher = {Elsevier}, address = {London}, issn = {1045-926X}, doi = {10.1016/j.jvlc.2010.11.002}, pages = {30 -- 55}, year = {2011}, abstract = {A business process is a set of steps designed to be executed in a certain order to achieve a business value. Such processes are often driven by and documented using process models. Nowadays, process models are also applied to drive process execution. Thus, correctness of business process models is a must. Much of the work has been devoted to check general, domain-independent correctness criteria, such as soundness. However, business processes must also adhere to and show compliance with various regulations and constraints, the so-called compliance requirements. These are domain-dependent requirements. In many situations, verifying compliance on a model level is of great value, since violations can be resolved in an early stage prior to execution. However, this calls for using formal verification techniques, e.g., model checking, that are too complex for business experts to apply. In this paper, we utilize a visual language. BPMN-Q to express compliance requirements visually in a way similar to that used by business experts to build process models. Still, using a pattern based approach, each BPMN-Qgraph has a formal temporal logic expression in computational tree logic (CTL). Moreover, the user is able to express constraints, i.e., compliance rules, regarding control flow and data flow aspects. In order to provide valuable feedback to a user in case of violations, we depend on temporal logic querying approaches as well as BPMN-Q to visually highlight paths in a process model whose execution causes violations.}, language = {en} } @article{MeyerPufahlBatoulisetal.2015, author = {Meyer, Andreas and Pufahl, Luise and Batoulis, Kimon and Fahland, Dirk and Weske, Mathias}, title = {Automating data exchange in process choreographies}, series = {Information systems}, volume = {53}, journal = {Information systems}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2015.03.008}, pages = {296 -- 329}, year = {2015}, abstract = {Communication between organizations is formalized as process choreographies in daily business. While the correct ordering of exchanged messages can be modeled and enacted with current choreography techniques, no approach exists to describe and automate the exchange of data between processes in a choreography using messages. This paper describes an entirely model-driven approach for BPMN introducing a few concepts that suffice to model data retrieval, data transformation, message exchange, and correlation four aspects of data exchange. For automation, this work utilizes a recent concept to enact data dependencies in internal processes. We present a modeling guideline to derive local process models from a given choreography; their operational semantics allows to correctly enact the entire choreography from the derived models only including the exchange of data. Targeting on successful interactions, we discuss means to ensure correct process choreography modeling. Finally, we implemented our approach by extending the camunda BPM platform with our approach and show its feasibility by realizing all service interaction patterns using only model-based concepts. (C) 2015 Elsevier Ltd. All rights reserved.}, language = {en} } @article{WeidlichPolyvyanyyMendlingetal.2011, author = {Weidlich, Matthias and Polyvyanyy, Artem and Mendling, Jan and Weske, Mathias}, title = {Causal behavioural profiles - efficient computation, applications, and evaluation}, series = {Fundamenta informaticae}, volume = {113}, journal = {Fundamenta informaticae}, number = {3-4}, publisher = {IOS Press}, address = {Amsterdam}, issn = {0169-2968}, doi = {10.3233/FI-2011-614}, pages = {399 -- 435}, year = {2011}, abstract = {Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S-or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.}, language = {en} } @article{WeidlichPolyvyanyyDesaietal.2011, author = {Weidlich, Matthias and Polyvyanyy, Artem and Desai, Nirmit and Mendling, Jan and Weske, Mathias}, title = {Process compliance analysis based on behavioural profiles}, series = {Information systems}, volume = {36}, journal = {Information systems}, number = {7}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2011.04.002}, pages = {1009 -- 1025}, year = {2011}, abstract = {Process compliance measurement is getting increasing attention in companies due to stricter legal requirements and market pressure for operational excellence. In order to judge on compliance of the business processing, the degree of behavioural deviation of a case, i.e., an observed execution sequence, is quantified with respect to a process model (referred to as fitness, or recall). Recently, different compliance measures have been proposed. Still, nearly all of them are grounded on state-based techniques and the trace equivalence criterion, in particular. As a consequence, these approaches have to deal with the state explosion problem. In this paper, we argue that a behavioural abstraction may be leveraged to measure the compliance of a process log - a collection of cases. To this end, we utilise causal behavioural profiles that capture the behavioural characteristics of process models and cases, and can be computed efficiently. We propose different compliance measures based on these profiles, discuss the impact of noise in process logs on our measures, and show how diagnostic information on non-compliance is derived. As a validation, we report on findings of applying our approach in a case study with an international service provider.}, language = {en} } @article{RoggeSoltiWeske2015, author = {Rogge-Solti, Andreas and Weske, Mathias}, title = {Prediction of business process durations using non-Markovian stochastic Petri nets}, series = {Information systems}, volume = {54}, journal = {Information systems}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2015.04.004}, pages = {1 -- 14}, year = {2015}, abstract = {Companies need to efficiently manage their business processes to deliver products and services in time. Therefore, they monitor the progress of individual cases to be able to timely detect undesired deviations and to react accordingly. For example, companies can decide to speed up process execution by raising alerts or by using additional resources, which increases the chance that a certain deadline or service level agreement can be met. Central to such process control is accurate prediction of the remaining time of a case and the estimation of the risk of missing a deadline. To achieve this goal, we use a specific kind of stochastic Petri nets that can capture arbitrary duration distributions. Thereby, we are able to achieve higher prediction accuracy than related approaches. Further, we evaluate the approach in comparison to state of the art approaches and show the potential of exploiting a so far untapped source of information: the elapsed time since the last observed event. Real-world case studies in the financial and logistics domain serve to illustrate and evaluate the approach presented. (C) 2015 Elsevier Ltd. All rights reserved.}, language = {en} } @article{PolyvyanyyGarciaBanuelosFahlandetal.2014, author = {Polyvyanyy, Artem and Garcia-Banuelos, Luciano and Fahland, Dirk and Weske, Mathias}, title = {Maximal structuring of acyclic process models}, series = {The computer journal : a publication of the British Computer Society}, volume = {57}, journal = {The computer journal : a publication of the British Computer Society}, number = {1}, publisher = {Oxford Univ. Press}, address = {Oxford}, issn = {0010-4620}, doi = {10.1093/comjnl/bxs126}, pages = {12 -- 35}, year = {2014}, abstract = {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.}, language = {en} } @misc{WeskeSadiqSofferetal.2016, author = {Weske, Mathias and Sadiq, Shazia and Soffer, Pnina and Voelzer, Hagen}, title = {Preface to BPM 2014}, series = {Information systems}, volume = {56}, journal = {Information systems}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2015.09.006}, pages = {233 -- 234}, year = {2016}, language = {en} }