Conference Paper

Merging Business Process Models

DOI: 10.1007/978-3-642-16934-2_10 Conference: On the Move to Meaningful Internet Systems: OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Hersonissos, Crete, Greece, October 25-29, 2010, Proceedings, Part I
Source: DBLP


This paper addresses the following problem: given two business process models, create a process model that is the union of the process models given as input. In other words, the behavior of the produced process model should encompass that of the input models. The paper describes an algorithm that produces a single configurable process model from a pair of process models. The algorithm works by extracting the common parts of the input process models, creating a single copy of them, and appending the differences as branches of configurable connectors. This way, the merged process model is kept as small as possible, while still capturing all the behavior of the input models. Moreover, analysts are able to trace back which model(s) a given element in the merged model originates from. The algorithm has been prototyped and tested against process models taken from several application domains.

Download full-text


Available from: Marlon Dumas
  • Source
    • "In this section, we show that, in contrast to the work in [12], we do not need to annotate all the control flows of the obtained matrix to keep the behavior of the input fragments, but only particular ones. a1 a2 a3 a4 a5 a1 {⟨(a1, gc1) (gc1, a2)⟩} a2 {⟨(a2, g d1 ), {⟨(a2, g d1 ), (g d1 , gc2), (g d1 , g), (gc2, a3)⟩, (g, a5)⟩} ⟨(a2, g d1 ), (g d1 , g), (g, gc2), (gc2, a3)⟩} a3 a4 {⟨(a4, gc1) a4 (gc1, a2)⟩} a5 Fig. 6. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent researches have proposed to retrieve rel-evant fragments out from whole business processes to build new ones. Although they avoid building business processes from scratch, this task has been performed independently for each process, thus, making resulting fragments handling complicated. In this paper, we propose to merge some given business process fragments in order to facilitate the fragment-based business pro-cess design. At the same time, the obtained fragment must keep the behavior of original fragments so as to avoid paths execution blockage while the obtained fragments are integrated as part of a complete process. Our approach presents a systematic merge revolving around the so-called adjacency matrices. Typically used to handle graphs, this mechanism is adapted to business process fragments. We also present some rules to provide the obtained fragments with the behavior of original fragments and avoid inconsistent behaviors that were newly added after the merge.
    Full-text · Conference Paper · Aug 2014
  • Source
    • "In cases where, at least, some of the participants always participate in some inter-organizational enterprise it may be beneficial to develop an integrated model, optimize it and then create participant local process models. The algorithm of [32] generates a configurable integrated process model from a set of process models, and then allows the derivation of a new set of individual process models. Methods exist for constructing consolidated business process models out of collections of process models that preserve behavior, also allow for the identification of the most recurring fragments across a collection of process models, so that they can focus their efforts on optimizing these fragments [33]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The support for coordination and choreography of independently-developed and locally-managed distributed processes is a key requirement of the emerging business environment in which organizations form, and break, relationships with other organizations on the fly to meet business goals, for example, provide customer and stakeholder value. The current set of Business Process Management Systems do not support this dynamicity of relationships and processes - or process mobility - creating new channels, reassigning channels, in particular, to processes whose existence becomes known only at run-time and may differ by instance. This dynamic nature of the relationships and processes is founded on π-calculus mobility. This paper presents a new approach to implement π-calculus mobility using DIME network architecture; it is shown how process mobility is an inherent capability of DIMEs. This paper also proposes the use of DIME FCAPS capabilities to support business services management, including fault tolerance, performance and security.
    Full-text · Conference Paper · Jun 2012
  • Source
    • "This approach is operationalized as a ProM plug-in. [65] presents an algorithm to merge process variants into a configurable process model [102] where divergencies between common and variant-specific fragments are marked via configurable connectors. The mapping between two input variants relies on the similarity of their nodes' labels (including resource and object nodes) and of their graph structures. "
    [Show abstract] [Hide abstract]
    ABSTRACT: As a result of the growing adoption of Business Process Management (BPM) technology, different stakeholders need to understand and agree upon the process models that are used to configure BPM systems. However, BPM users have problems dealing with the complexity of such models. Therefore, the challenge is to improve the comprehension of process models. While a substantial amount of literature is devoted to this topic, there is no overview of the various mechanisms that exist to deal with managing complexity in (large) process models. As a result, it is hard to obtain an insight into the degree of support offered for complexity reducing mechanisms by state-of-the-art languages and tools. This paper focuses on complexity reduction mechanisms that affect the abstract syntax of a process model, i.e., the formal structure of process model elements and their interrelationships. These mechanisms are captured as patterns so that they can be described in their most general form, in a language- and tool-independent manner. The paper concludes with a comparative overview of the degree of support for these patterns offered by state-of-the-art languages and tools, and with an evaluation of the patterns from a usability perspective, as perceived by BPM practitioners.
    Full-text · Article · Nov 2011 · IEEE Transactions on Industrial Informatics
Show more