<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>On the Translation between BPMN and BPEL: Conceptual Mismatch between Process Modeling Languages</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jan Recker</string-name>
          <email>j.recker@qut.edu.au</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jan Mendling</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Queensland University of Technology 126</institution>
          <addr-line>Margaret Street, Brisbane QLD 4000</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Vienna University of Economics and Business Administration Augasse 2-6</institution>
          ,
          <addr-line>1090 Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Business practice shows that, often, different process models are employed in the various phases of the Business Process Management life cycle, each providing a different paradigm for capturing and representing the business process domain. Recently, significant efforts have been made to overcome the disintegration of process models by providing complementary language standards for process design (BPMN) and execution (BPEL), based on the claim that these languages are semantically integrated. However, the conceptual mapping between both languages remains unclear, thus it is undecided whether any BPMN diagram can be transformed to BPEL. In this paper we argue that there is conceptual mismatch between BPMN and BPEL that needs to be identified in order to guide the language integration process semantically. In our analysis we take into account the various perspectives of the Business Process Management life cycle, in particular business and technical analyst perspectives. Our approach is generic and can also be utilized as a guiding framework for identifying conceptual mismatch between other business process modeling languages.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In theory, Business Process Management (BPM) efforts follow a certain life cycle [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
that idealizes the phases of development and deployment of business processes into the
stages of design, implementation, enactment, and evaluation. In principle, the design
phase involves the development of conceptual process models from a business analyst
perspective. As a second step, these models serve as input to technical analysts
concerned with the development of technical process models, i.e., implementation
models in the form of executable workflow specifications. These specifications then serve
as templates for the enactment of process instances deployed on a workflow engine.
Lastly, the execution of a process is monitored and evaluated to guide the revision and
improvement of the process models as part of another iteration of the life cycle.
      </p>
      <p>
        In business practice, however, the transition between these phases is often broken.
As the process design and execution stages usually employ different modeling
languages, this translation is prone to semantic ambiguities [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This may cause the loss
of design considerations within the execution models. We refer to such undesirable
cases as conceptual mismatch between process modeling languages deployed in
different phases of the BPM life cycle. Accordingly, the transition between the phases seems
to be an important prerequisite to make the process management life cycle work, in
particular, between business analyst and technical analyst models [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ].
      </p>
      <p>
        The Business Process Modeling Notation (BPMN) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] has been developed with the
ambition to bridge the gap between business analyst and technical analyst by providing
a standard visual notation for executable BPEL processes and by also specifying a
formal mapping between BPMN to BPEL. In fact, the specification document states that
”BPMN creates a standardized bridge for the gap between the business process design
and process implementation.” [3, p. 1]. However, as we will discuss during the course
of this paper, the translation of BPMN to BPEL is far from trivial.
      </p>
      <p>Specifically, we argue that mapping issues arise from conceptual mismatch between
the two process modeling languages based on the assumption that the languages differ
in expressive power, which in turn hinders the translation of models between these
languages. Accordingly, the first and foremost objective of this paper is to discuss how
conceptual mismatch between business analyst and technical analyst process models
can be identified. Despite the focus on BPMN and BPEL we seek to deliver a generic
solution that builds on established evaluation theories in the field of process modeling.
Forthcoming from this discussion, as a second contribution of this paper we provide
guidance for the translation of process models in the form of abstract transformation
strategies that we deem promising for overcoming the identified mismatch.</p>
      <p>We proceed as follows: in Section 2 we briefly introduce BPEL and BPMN. Also,
in Section 2.3 we discuss existing studies on the correspondence between BPMN and
BPEL, which show that there appears to be significant mismatch between the
languages that hinders if not counteracts translation specifications. In Section 3 we then
derive a multi-perspective method for identifying conceptual mismatch between business
process modeling languages and apply it to BPMN and BPEL (Sections 3.1, 3.2, and
3.3). We close in Section 4 by drawing some conclusions from our work.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Background &amp; Related Work</title>
      <sec id="sec-2-1">
        <title>BPEL4WS</title>
        <p>
          The Business Process Execution Language for Web Services [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], in its essence, is an
extension of imperative programming languages with constructs specific to the BPM
domain, in particular web service implementations. Version 1.1 of BPEL was released
in 2003 and its version 2.0 is currently in process of standardization with OASIS. A
BPEL process definition specifies the technical details of a workflow that offers a
complex Web Service build from a set of elementary Web Services. The most important
concepts of a BPEL process are variables, partnerLinkTypes, basic and structured
activities, as well as handlers. Variables store process data and messages that are exchanged
with Web Services. PartnerLinkTypes define the mutual required port types of a
message exchange by declaring which partner acts according to which role defined in a
partner link. Basic Activities specify the operations which are performed in a process.
These include Web Service operations like invoke, receive, or reply. There are further
activities for assigning data values to variables (assign) or wait to halt the process for
a certain time interval. Structured Activities are utilized for the definition of control
flow, e.g., to specify concurrency of activities (using flow), alternative branches (e.g.
via switch), or loops (while). Structured activities can be nested and links can be used
to express synchronization constraints between activities. Handlers can be defined in
order to respond to the occurrence of a fault, an event, or if a compensation has been
triggered. For further details on BPEL refer to the specification [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>BPMN</title>
        <p>
          The nature of executable languages such as BPEL renders them less suited for direct
use by humans to design, manage, and monitor the business processes that are enacted
by process-aware information systems. In order to provide a standard visual notation
for business processes defined in an executable process language, the Business Process
Modeling Notation in its version 1.0 was first released in May 2004 and in February
2006 approved by OMG as a final adopted specification [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. It has been the intention of
the BPMN designers to develop a modeling technique that supports (a) typical process
modeling activities for both business and technical analysts and (b) the straightforward
mapping to executable workflow specifications in BPEL.
        </p>
        <p>
          The complete BPMN specification defines thirty-eight distinct language constructs
plus attributes, grouped into four basic categories of elements. Flow Objects, such as
events, activities and gateways, are the most basic elements used to create Business
Process Diagrams (BPDs). Connecting Objects are used to inter-connect Flow Objects
through different sorts of arrows. Swimlanes are used to group activities into separate
categories for different functional capabilities or responsibilities (e.g., different roles
or organizational departments). Artefacts may be added to a diagram where deemed
appropriate in order to display further related information such as processed data or
other comments. For further details on BPMN refer to the specification [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Related Work on the Correspondence between BPMN and BPEL</title>
        <p>The recent momentum on BPMN and BPEL in industry practice has triggered
significant related research on these languages. In this section we focus on work that studies
the correspondence between these two seemingly complementary languages.</p>
        <p>
          Trying to support the claim that BPMN provides a visualization mechanism for
BPEL, subsection 11 of the BPMN specification [3, pp. 137–204] presents a mapping
between BPMN and BPEL; however, it is rather informally given in prose; a precise
algorithm and a definition of required structural properties is missing. An example
for how a mapping could work is given in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], however, it is rather simple and the
feasibility of such a mapping in the general case has not been demonstrated yet. It is
also worthwhile noting that some available software such as Telelogic’s System
Architect (www.telelogic.com/popkin/) support the generation of BPEL code from
BPMN diagrams, but only for a limited subset of BPMN.
        </p>
        <p>
          From an academic perspective, recent work has led to the proposal of transformation
strategies for process models, with focus often given to the case of BPMN and BPEL.
In [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] a general approach is presented to translate standard workflow models (refer to
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]) to BPEL by exploiting the BPEL construct ’event handler’. However, as the
authors admit, this approach only holds for a core subset of BPMN and UML Activity
Diagrams. Later, this approach has been adopted to the specific context of BPMN and
BPEL [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Again, this approach relies on the discovery of process patterns in BPMN
models, which are tried to be mapped onto BPEL structured activities. While this
approach, too, is not yet at a stage where it holds for more advanced BPMN models, it is
closely related to our forthcoming discussion as we specifically take into account the
mismatch between BPMN and BPEL with respect to the representation of such control
flow patterns. Another interesting approach is discussed in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], where the authors
discuss different strategies for translating graph-oriented models (like BPMN) to
blockoriented specifications (like BPEL). These strategies have different perks and perils,
nevertheless, we deem them a suitable starting point for devising concrete mappings
based on an identification and understanding of the mismatch between the languages;
hence, we will refer back to them later in this paper.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conceptual Mismatch between BPMN and BPEL</title>
      <p>As the discussion of related work reveals, existing transformation strategies falter when
it comes to defining general mappings. We argue that conceptual mismatch exists that
we assume to be a root cause for the translation problems. Our forthcoming discussion
rests on two observations in this context:
– BPEL and BPMN come from different backgrounds (technical analyst versus
address business analyst). Thus, they employ different paradigms for capturing
relevant aspects of business processes, which in turn leads to the manifestation of
conceptual mismatch with respect to the semantic expressiveness of these languages.
– BPEL and BPMN are employed in different stages of the BPM life cycle. Hence,
the requirements of both stages need to be taken into consideration when
identifying potential conceptual mismatch.</p>
      <p>Based on these observations we argue that, specifically, the different BPM
lifecycle perspectives need to be taken into consideration when devising a transformation
between process models.</p>
      <p>
        In particular, from a business analyst perspective, the transition between BPMN
and BPEL must preserve the semantic information about the represented domain, viz.,
it should minimize if not avoid loss of semantic representation information. In this
regard, Wand and Weber’s work [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is widely acknowledged as a framework of
realworld domains concepts that modeling languages should be able to represent. In other
words, a transition between languages should establish a high extent of matching
domain representation capabilities between the two languages. From a technical analyst
perspective, the underlying workflow execution engine determines the specification of
processes. In this regard, Kiepuszewski et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] state that control flow is a central
aspect of a business process that needs to be sufficiently supported by any given language.
Therefore, a transition between languages should establish a high extent of matching
control flow support. Beyond that, several authors in the field [
        <xref ref-type="bibr" rid="ref6 ref9">6, 9</xref>
        ] state that the
underlying process representation paradigm, i.e., block-oriented vs. graph-oriented process
representation, is another source of conceptual mismatch between process modeling
languages. While both domain representation capabilities and control flow support
permit statements about whether certain relevant aspects of a process can be expressed,
the process representation paradigm influences how such aspects can be expressed.
      </p>
      <p>
        Forthcoming from this argumentation, a method for identifying the conceptual
mismatch between business and technical analyst process models must be able to identify
all three types of conceptual mismatch. We will employ two established evaluation
frameworks, namely Representation Theory [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ] (Section 3.1) for the specification
of domain representation capability mismatch, and the Workflow Patterns framework
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] (Section 3.2) for the specification of control flow support mismatch. In addition
to these established theories, Section 3.3 introduces a mismatch identification method
based on a set of transformation strategies [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] that can potentially be used to translate
process models into another.
      </p>
      <p>
        The selection of the mentioned evaluation frameworks can be reasoned by their
reasonable maturity, their rigorous development, their structured evaluation approach
and foremost by their established track record in the field of process modeling. For
overviews refer, for instance, to [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], respectively. In particular, as we seek to
deliver a general contribution beyond the case of BPMN and BPEL, the high level of
dissemination of these theories in the field of process modeling reasons our selection,
as it allows for a wider uptake of our approach to cases of other process modeling
languages that have previously been evaluated (e.g., BPML and WSCI).
3.1
      </p>
      <sec id="sec-3-1">
        <title>Identifying Domain Representation Capability Mismatch</title>
        <p>
          Evaluation using Representation Theory, exemplarily [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ], rests on the assumption
that computerized information systems are essentially representations of real world
systems and that IS models must hence contain the necessary representations of real world
constructs including their properties and interactions. The BWW representation model
(short: the BWW model) contains four clusters of constructs that are deemed necessary
to faithfully provide complete and clear representations of the semantics of information
systems domains: things including properties and types of things; states assumed by
things; events and transformations occurring on things; and systems structured around
things. For a more complete description refer, for instance, to [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>
          Evaluation of modeling languages by means of Representation Theory seeks to
reveal construct deficit within languages, which inhibits them from making statements
about certain domain aspects [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. We use this type of evaluation to investigate only
those types of construct deficit in a particular language (e.g., BPMN) that another
language (e.g., BPEL) is able to express and argue that this particular form of deficit
constitutes a mismatch that in turn potentially impacts the translation of models between these
languages. This means that if a more expressive process modeling language features a
representation construct that is not supported in a less expressive process modeling
language, then the translation of the modeled process to the less detailed language will be
at cost of losing expressive power and thus, semantic information about the represented
domain.
        </p>
        <p>
          For the purpose of this paper, we draw on the individual analyzes of BPMN [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]
and BPEL [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] and provide a cluster-oriented discussion of the differences between
BPMN and BPEL in terms of their construct deficit (see Table 1). Representation
Theory offers a systematic analytical method, overlap analysis [
          <xref ref-type="bibr" rid="ref10 ref16">10, 16</xref>
          ], for a thorough and
more detailed evaluation of the completeness and overlap of domain representations in
a combination of languages. We must consider such an evaluation out of scope for this
paper; however, we see an interesting and important research challenge in such an
overlap analysis in order to comprehensively clarify the type of mismatch between BPMN
and BPEL.
indicates that the respective language provides one construct supporting the
representation of the respective BWW model construct, a “++” indicates a support for the BWW
model construct by more than one language construct and a “–” indicates a lack of
support for the respective BWW model construct.
        </p>
        <p>As can be seen from Table 1, there are a number of potential domain representation
capability mismatches between BPMN and BPEL, indicated by varying support for the
BWW model constructs. The following paragraphs discuss some of these discrepancies
with respect to a potential translation of process models from BPMN to BPEL.
Translation of things A thing denotes the elementary notion in Representation
Theory. The perceived world is constituted of things, either imaginary or real, that can be
grouped into sets and species of things (class and kind, respectively). Table 1 reveals
that BPMN is capable of representing things, classes, and kinds of things. However,
BPEL only supports the representation of classes of things, viz., BPEL can only make
semantic statements about groups of things but not specific instances. This means that
object instances in a BPD, e.g., a specific organizational entity, a specific business
partner or a specific application system, possibly need to be generalized to classes of
instances, i.e., to a more aggregate level. On the other hand, the rather limited and general
representation of properties of things in BPMN can be broken down into more
specialized subtypes of properties in BPEL (see Table 1).</p>
        <p>
          Translation of states A state of a thing is a vector of all the property values of a thing
at a given point of time. Table 1 reveals that both BPMN and BPEL lack expressive
power for modeling states assumed by things. While this finding may be problematic
in general [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], it does not denote a area of concern with respect to translating BPMN
diagrams to BPEL as both languages basically share the same (in-) capabilities with
regards to explicit state representation.
        </p>
        <p>
          Translation of events and transformations The occurrence of an event changes the
state of a thing. A transformation is the mapping between two states of a thing.
Table 1 reveals that BPMN has more expressive power than BPEL for the representation
of events and transformations occurring on things. However, there seems to be a high
extent of redundancy of BPMN in terms of transformation and event modeling [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ],
viz., BPMN offers many overlapping constructs and thus lacks orthogonality. This goes
alongside with the finding that a translation to BPEL potentially needs to map certain
dedicated event subtypes within BPMN to a single event type of BPEL (for instance,
external events). Transformations, however, are more differentiated in BPEL, implying
that transformation representations in BPMN potentially need to be annotated with
further information or attributes to sufficiently specify a mapping to an appropriate BPEL
construct.
        </p>
        <p>Translation of systems Things can be composed to a system, which may have
subsystems and interfaces to the environment of the system. Table 1 reveals that BPMN’s
support for the modeling of systems structured around things excels the support
provided by BPEL. Thus, a BPMN specification of the system to be developed, especially
the demarcation from its environment (system environment) and its disaggregation into
subsystems (system decomposition), might not be unambiguously translatable into
executable BPEL specifications and may thus require extra modeling and specification
effort to avoid misinterpretations of the resulting BPEL models. In particular, the
mapping of the BPMN Pool and Lane constructs to the BPEL Partner construct will require
attention as the semantics of Pool and Lane seem to be more extensive than any BPEL
counterpart.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Identifying Control Flow Support Mismatch</title>
        <p>
          The development of the Workflow Patterns framework (www.workflowpatterns.
com) was triggered by a bottom-up analysis and comparison of workflow management
software. The goal was to bring insights into the expressive power of the underlying
process execution languages. This work identified 20 control flow patterns [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] that
specify atomic chunks of behavior capturing some specific process control
requirements. The identified patterns span from simple to complex control flow scenarios and
provide a taxonomy for the control flow perspective of workflows and processes. This
taxonomy, in turn, has been widely used as a benchmark for analysis and comparison
of process specification and execution languages.
        </p>
        <p>
          Here we use the Workflow Patterns framework to draw conclusions as to the control
flow support mismatch between BPMN and BPEL, drawing on the individual analyzes
of BPMN [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and BPEL [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. Table 2 summarizes the findings from both analyzes.
In this table, a “+” indicates a direct support for a pattern, a “+/–” indicates a partial
support and a “–” indicates a lack of support.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Translation of basic, state-based, and cancellation patterns Table 2 reveals that</title>
        <p>
          BPMN and BPEL both support patterns 1–5 and 16–20 in the same manner. This means
that the representations of these control flow patterns in BPMN should be
unambiguously translatable to BPEL. This finding supports the approach taken in [
          <xref ref-type="bibr" rid="ref6 ref8">6, 8</xref>
          ], in which
mappings between BPMN and BPEL are defined based on their support for various
control flow patterns.
        </p>
        <p>
          Translation of advanced synchronization patterns Table 2 reveals that BPMN
provides almost full support for patterns 6–9. BPEL, however, lacks support for
multiple merges and discriminators. In particular, BPEL does not support the invocation of
sub-processes [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], which, however, can be supported by BPMN. A specific problem
is BPEL’s missing support for the discriminator pattern, i.e., points in the workflow
process that wait for one of the incoming branches to complete before activating the
subsequent activity. Hence, discriminators used in BPMN require considerable effort in
translating them to statements that (a) are expressible in BPEL and (b) bear the same
semantics as to the handling of control flow.
        </p>
        <p>Translation of structural patterns BPEL does not support arbitrary cycles. The While
activity can only capture structured cycles, i.e., loops with one entry point and one exit
point. Again, this is a potential area of concern when translating arbitrary cycles from
BPMN to BPEL code with equivalent control flow semantics.</p>
        <p>Translation of multiple instances patterns Table 2 reveals that BPMN and BPEL
both support patterns 12, 13 and 15 in the same manner but not pattern 14. This means
that the BPMN representation of a workflow with multiple instances (where a number
of instances of a given activity are initiated, and these instances are later synchronized,
before proceeding with the rest of the process)3 needs to be translated into a less
expressive form in BPEL4WS and hence, some desired control flow support and design
considerations for the modeled process are prone to getting lost.
3.3</p>
      </sec>
      <sec id="sec-3-4">
        <title>Identifying Process Representation Paradigm Mismatch</title>
        <p>
          We argue that a transformation of models must consider not only representational
capabilities and control flow pattern support, but also the underlying process representation
paradigm. In this context, there are essentially two paradigms to depict processes in
a process modeling language: graph-oriented and block-oriented representation [
          <xref ref-type="bibr" rid="ref6 ref9">6, 9</xref>
          ].
BPMN follows a graph-oriented paradigm using arcs to define a partial order of
activities and gateways to express split and join behavior. BPEL utilizes a block-oriented
paradigm to express control flow via nested structured activities enhanced with some
restricted graph concepts: in a BPEL process, arbitrary synchronization can be expressed
with links as long as the links are acyclic. Cycles are only allowed if they are modeled
as structured loops using the ’While’ activity.
        </p>
        <p>
          In [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], graph-based languages like BPMN and languages similar to BPEL are
abstracted to so-called process graphs and BPEL control flow, respectively, in order to
3 For pattern 14, the number of instances is known at some stage during run time, but before the
initiation of the instances has started.
identify transformation strategies and constraints for the application of these strategies.
In this context, a process graph is called structured, if split gateways match a join of
the same type, and if loops are entered at one XOR join and exited at one XOR split.
Furthermore, a process graph is acyclic if no node can be reached from itself. A BPEL
process is structured if it does not include any links. Some transformation strategies
are only applicable for process models that fulfil certain properties (see Table 3). For
a formal definition of structured and cyclic process graphs as well as structured BPEL
control flow refer to [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. This reference also defines algorithms for each of the four
transformation strategy that will be sketched in the following.
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>Transformation Strategies from BPMN to BPEL All four transformation strate</title>
        <p>
          gies (see Table 3) require that all cycles of the BPMN process model are structured
loops with an entering XOR join and an exiting XOR split. The idea of the
ElementPreservation Strategy is to map all BPMN elements to suitable BPEL elements nested
in a BPEL flow and define control flow with links. Gateways are mapped to BPEL
empty activities that serve as target and source for multiple input (join) or output links
(split). The Element-Minimization Strategy takes the result of the Element-Preservation
Strategy and replaces the empty activities with links containing transition conditions.
The Structure-Identification Strategy works similar to the transformation proposed in
the BPMN specification [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. Structured blocks can be identified via graph reduction
rules defined in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. This strategy is only applicable if all control flow can be mapped
to BPEL structured activities. If not, the Structure-Maximization Strategy can be
applied to derive a BPEL process with as many structured activities as possible nested
in a flow for additional synchronization constraints. As Table 3 emphasizes, there is
no strategy to generate BPEL from an arbitrary BPMN graph because BPEL does not
permit modeling of arbitrary cycles.
        </p>
        <p>Transformation Strategies from BPEL to BPMN The transformation from BPEL
to BPMN imposes restrictions only for one strategy. The Flattening Strategy can be
utilized to transform any BPEL control flow to BPMN. BPEL structured activities are
flattened to gateways and arcs without any nesting. The Hierarchy-Preservation
Strategy can be applied if the descriptive semantics of structured activities have to be
preserved in the resulting BPMN. Each type of structured activity is mapped to a respective
subprocess in BPMN. The Hierarchy-Maximization Strategy maps BPEL structured
activities to sub-processes if there is no link crossing its borders. Table 3 shows that
arbitrary BPEL processes can be mapped to BPMN using the flattening or the
hierarchymaximization strategy.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Contributions &amp; Conclusions</title>
      <p>This paper discussed conceptual mismatch between BPMN and BPEL. We used a
general multi-perspective method for identifying conceptual mismatch between process
modeling languages employed in different stages of the BPM life cycle. In particular,
our identification method applies established evaluation theories and innovative
transformation strategies in order to identify potential mapping issues in the form of:
– Domain Representation Capability Mismatch: We showed how Representation
Theory can be used to compare the representational capabilities of different process
modeling languages in terms of divergences in the expressiveness of various
aspects of domain semantics.
– Control Flow Support Mismatch: We showed how the Workflow Patterns
Framework can be used to identify discrepancies between process modeling languages in
terms of their support for various aspects of control flow.
– Process Representation Paradigm Mismatch: We showed how different
representation paradigms underlying process modeling languages require different
transformation strategies and we sketched out the implications of four different strategies.</p>
      <p>Our analysis of the conceptual mismatch between BPMN and BPEL reveals that
BPMN provides a much richer set of modeling constructs. A translation from technical
BPEL to BPMN is therefore less a problem than in the opposite direction. On the other
hand, BPMN is meant to be utilized as a visual notation for BPEL processes, but, as
some of the BPMN constructs cannot be expressed in BPEL, a translation would imply a
loss of information. For example, the missing BPEL support for a range of control flow
patterns that BPMN can support may, in a translation from BPMN to BPEL, lead to
execution semantics that were not intended in the conceptual model. As a consequence,
either process modeling in BPMN has to be restricted to those constructs that have an
equivalent in BPEL, or a remodeling might be necessary on the level of BPEL in order
to handle untranslatable constructs. In order to make the business process life cycle
work, it seems to be a better option to restrict BPMN rather than to extend BPEL, as
extensions of the latter may not be supported by existing standard compliant process
engines.</p>
      <p>
        As to directions to further research, we perceive this work to be a starting point for
a more detailed analysis of BPMN and BPEL (and other combinations of languages)
using the approach presented. In particular, we see a need to comparatively assess the
varying domain representation capabilities, and control flow support, of BPMN and
BPEL in more detail, for example, by means of overlap analysis [
        <xref ref-type="bibr" rid="ref10 ref16">10, 16</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. zur Muehlen,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Rosemann</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.:</surname>
          </string-name>
          <article-title>Multi-Paradigm Process Management</article-title>
          . In Grundspenkis, J.,
          <string-name>
            <surname>Kirikova</surname>
          </string-name>
          , M., eds.
          <source>: Proceedings of the CAiSE'04 Workshops</source>
          . Vol.
          <volume>2</volume>
          . Faculty of Computer Science and Information Technology, Riga Technical University, Riga, Latvia (
          <year>2004</year>
          )
          <fpage>169</fpage>
          -
          <lpage>175</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Dreiling</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosemann</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          :
          <article-title>From Conceptual Process Models to Running Workflows: A Holistic Approach for the Configuration of Enterprise Systems</article-title>
          .
          <source>In: Proceedings of the 9th Pacific Asia Conference on Information Systems</source>
          , Bangkok, Thailand (
          <year>2005</year>
          )
          <fpage>363</fpage>
          -
          <lpage>376</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. BPMI.org, OMG: Business Process Modeling Notation Specification. Final Adopted Specification, http://www.bpmn.org/. (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Andrews</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Curbera</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dholakia</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goland</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leymann</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roller</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thatte</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trickovic</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weerawarana</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <source>Business Process Execution Language for Web Services, Version</source>
          <volume>1</volume>
          .1.
          <string-name>
            <surname>Specification</surname>
            , BEA Systems, IBM Corp.,
            <given-names>Microsoft</given-names>
          </string-name>
          <string-name>
            <surname>Corp</surname>
          </string-name>
          .,
          <string-name>
            <surname>SAP</surname>
            <given-names>AG</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Siebel Systems</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>White</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>Using BPMN to Model a BPEL Process</article-title>
          .
          <source>BPTrends 3</source>
          (
          <year>2005</year>
          )
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ouyang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breutel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , ter
          <string-name>
            <surname>Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          :
          <article-title>Translating Standard Process Models to BPEL</article-title>
          . In Pohl, K., ed.
          <source>: 18th Conference on Advanced Information Systems Engineering</source>
          , Luxembourg, Grand-Duchy of Luxembourg, Springer (
          <year>2006</year>
          ) forthcoming
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kiepuszewski</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          :
          <article-title>Fundamentals of Control Flow in Workflows</article-title>
          .
          <source>Acta Informatica</source>
          <volume>39</volume>
          (
          <year>2003</year>
          )
          <fpage>143</fpage>
          -
          <lpage>209</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ouyang</surname>
          </string-name>
          , C.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          :
          <article-title>Translating BPMN to BPEL</article-title>
          .
          <source>BPM Center Report BPM-06-02</source>
          , BPMcenter.org (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mendling</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lassen</surname>
            ,
            <given-names>K.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zdun</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages</article-title>
          . In
          <string-name>
            <surname>Lehner</surname>
          </string-name>
          , F., N o¨sekabel, H.,
          <string-name>
            <surname>Kleinschmidt</surname>
          </string-name>
          , P., eds.:
          <source>Multikonferenz Wirtschaftsinformatik</source>
          <year>2006</year>
          .
          <article-title>Band 2</article-title>
          . GITO-Verlag, Berlin, Germany (
          <year>2006</year>
          )
          <fpage>297</fpage>
          -
          <lpage>312</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Wand</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <source>On the Deep Structure of Information Systems. Information Systems Journal</source>
          <volume>5</volume>
          (
          <year>1995</year>
          )
          <fpage>203</fpage>
          -
          <lpage>223</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Wand</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <source>On the Ontological Expressiveness of Information Systems Analysis and Design Grammars. Journal of Information Systems</source>
          <volume>3</volume>
          (
          <year>1993</year>
          )
          <fpage>217</fpage>
          -
          <lpage>237</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kiepuszewski</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barros</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          : Workflow Patterns.
          <source>Distributed and Parallel Databases</source>
          <volume>14</volume>
          (
          <year>2003</year>
          )
          <fpage>5</fpage>
          -
          <lpage>51</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rosemann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Recker</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Indulska</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Green</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>A Study of the Evolution of the Representational Capabilities of Process Modeling Grammars</article-title>
          . In Pohl, K., ed.
          <source>: 18th Conference on Advanced Information Systems Engineering</source>
          , Luxembourg, Grand-Duchy of Luxembourg, Springer (
          <year>2006</year>
          ) forthcoming
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wohed</surname>
            , P., van der Aalst,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          :
          <article-title>Pattern-based Analysis of BPMN - An extensive evaluation of the Control-flow, the Data and the Resource Perspectives</article-title>
          .
          <source>BPM Center Report BPM-05-26</source>
          , www.BPMcenter.org (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Recker</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Indulska</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosemann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Green</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Do Process Modelling Techniques Get Better? A Comparative Ontological Analysis of BPMN</article-title>
          . In Campbell,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Underwood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Bunker</surname>
          </string-name>
          , D., eds.
          <source>: 16th Australasian Conference on Information Systems. Australasian Chapter of the Association for Information Systems</source>
          , Sydney, Australia (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Green</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosemann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Indulska</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Candidate Interoperability Standards: An Ontological Overlap Analysis</article-title>
          .
          <source>Technical report</source>
          , University of Queensland (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Wohed</surname>
            , P., van der Aalst,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.:</given-names>
          </string-name>
          <article-title>Analysis of Web Services Composition Languages: The Case of BPEL4WS</article-title>
          . In Song, I.Y.,
          <string-name>
            <surname>Liddle</surname>
            ,
            <given-names>S.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ling</surname>
            ,
            <given-names>T.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scheuermann</surname>
          </string-name>
          , P., eds.:
          <string-name>
            <surname>Conceptual</surname>
            <given-names>Modeling - ER</given-names>
          </string-name>
          <year>2003</year>
          . Volume
          <volume>2813</volume>
          of Lecture Notes in Computer Science. Springer, Chicago, Illinois (
          <year>2003</year>
          )
          <fpage>200</fpage>
          -
          <lpage>215</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>