<!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>Preserving Data Consistency in Process Choreographies by Design</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Hasso Plattner Institute, University of Potsdam</institution>
          ,
          <addr-line>Potsdam</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>51</fpage>
      <lpage>55</lpage>
      <abstract>
        <p>Data is essential for the execution of business processes. As today's organizations increasingly collaborate in process choreographies, data relevant to process execution is typically shared among participants. To avoid conflicts in the execution of process choreographies, the preservation of data consistency must be considered in the design of a choreography. However, current choreography modeling languages provide limited data modeling capabilities, thus potential conflicts arising from data inconsistencies at runtime may remain undetected during design time. Therefore, this paper motivates a framework allowing the design of data consistency-aware process choreographies.</p>
      </abstract>
      <kwd-group>
        <kwd>Process Choreography</kwd>
        <kwd>Data Consistency</kwd>
        <kwd>Design Time</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In the current age of information, business processes and their outcomes rely on
data and its manipulation during process execution [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. As today’s organizations
increasingly collaborate in process choreographies [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], data relevant to business
process execution is typically shared across choreography participants. To ensure
the correct execution of the individual business processes involved in a process
choreography, data consistency, i.e., a uniform view of data shared across multiple
nodes [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], is a desirable property to be maintained among participants [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. As
the participants can only exchange data in the form of messages, maintaining
data consistency is particularly challenging in process choreographies. Local
changes to data shared with other participants can result in inconsistent views
of the data, which may lead to conflicts such as unexpected interactions or data
constraint violations on the receiving end. Since any deviation from the agreed
interaction behavior can afect operations and incur costs, process choreographies
require careful coordination [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Therefore, interaction behavior arising from
data inconsistencies needs to be considered during process choreography design.
The consideration of data consistency during design time is particularly relevant
for process choreographies since in process orchestrations consistency can usually
be enforced via central database management systems.
      </p>
      <p>
        To support the design of process choreographies, graphical modeling
languages such as Business Process Model and Notation (BPMN) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] can be used.
However, most contemporary choreography modeling languages provide only
limited data modeling capabilities. Therefore, potentially erroneous behavior
resulting from data inconsistencies may remain undetected during design time.
To illustrate the relevance of data management in choreography design, we
consider a simple online ticket reservation choreography depicted in Figure 1. The
choreography starts with a customer querying and selecting available seats for
an event. Then, depending on the price ofer, the customer decides whether
to cancel the reservation or book the tickets. In the latter case, the ticket
store confirms the reservation. While the interaction behavior is locally
enforceable [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], data inconsistencies may arise with concurrent executions.
Assuming that the ticket shop can sell only one ticket for each seat, if two
customers select overlapping seats and the reservation of the first customer is
confirmed, the second customer has an inconsistent view of the available seats.
Furthermore, since the confirmation of
the second reservation would lead to a
constraint violation on the part of the
ticket shop, compensation behavior is Customer Customer Customer Ticket Shop
required to restore the consistency be- avQsaeuialeatrbsyle Sseelaetcst tiBcokoekts bCooonkfiirnmg
tween the participants. Still, the need Ticket Shop Ticket Shop Ticket Shop Customer
for compensation and the compensa- Ticket Shop Customer
tion behavior itself are both not ev- Oprfifceer bCoaonkcinelg
ident from the given model. In the Customer Ticket Shop
following, related work in the area of
data consistency preservation is dis- Fig. 1. Ticket reservation choreography
becussed and a framework for designing tween a customer and an online ticket shop
consistency-aware process
choreographies is motivated.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Maintaining consistency in distributed environments is extensively studied in
literature [
        <xref ref-type="bibr" rid="ref10 ref3 ref6">3,6,10</xref>
        ]. In particular, the preservation of data consistency is addressed
by consensus protocols [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] which allow distributed nodes to agree on specific
data values required for further computation, thus providing a consistent view
of the data. The application of consensus protocols to process choreographies
is discussed by Weber et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The authors propose the use of blockchain
technology [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] as an execution environment for process choreographies. To model
and execute blockchain-driven choreographies, Ladleif et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] refine BPMN
2.0 choreography diagrams [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] with blockchain-specific extensions. However,
maintaining consensus in process choreographies may introduce synchronization
overhead as not every change needs to be propagated to all participants. Moreover,
in scenarios where inconsistencies rarely lead to conflicts, sustaining consensus
among all participants may limit concurrent behavior and thus afect throughput.
Incorporating data consistency management into the interaction design instead
allows the choreography to be eflxibly tailored to the use case.
      </p>
      <p>
        Despite the existence of approaches that enrich choreography models with
data management-specific information [
        <xref ref-type="bibr" rid="ref13 ref5">5,13</xref>
        ], the preservation of data consistency
in process choreographies with concurrent instances has received little attention
in research. Hahn et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] introduce an approach that decouples the data flow
between participants from the message flow by introducing a middleware that
coordinates cross-partner data objects among corresponding participants. Yet, the
handling of concurrent accesses to data shared by multiple instances is not further
specified in their approach. Haarmann et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] introduce a framework to analyze
the use of shared data in process models by defining data access semantics. While
the framework includes concepts for data consistency preservation, it does not
address data exchange between individual participants. Finally, Kopp et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
propose choreography spheres ensuring transactional behavior for all included
activities that may belong to diferent processes. Still, deciding on an adequate
scope of the spheres might prove challenging without data-related information,
as overly large transactions could create avoidable overhead.
3
      </p>
      <p>
        Towards Data Consistency in Process Choreographies
Since the integration of existing data consistency-preserving concepts into the
design of process choreographies poses various challenges as outlined in the previous
section, this paper proposes the concept of a framework supporting the
collaborative design of data consistency-aware process choreographies based on the
BPMN modeling language. The framework is supposed to enable the detection of
potential data inconsistencies between participants at design time that may lead
to conflicts at runtime. To achieve this, the framework will include functionality
to specify and verify data consistency-related information in process choreography
diagrams. Thus, participants should be enabled to define data consistency
constraints at the interaction level (i.e., in the public process) that must be followed
in the individual data management of each participant’s local behavior (i.e., in
the private process). The specifications will also allow participants to identify
activities or data objects that may be afected by inconsistent data and therefore
require careful attention in their design. In addition, data consistency criteria
are introduced to formally verify the preservation of consistency throughout the
choreography with regard to the specifications. The criteria should allow the
detection of interaction behaviors that potentially lead to conflicts considering
data inconsistencies that are not resolved in subsequent interactions. To design
the criteria, existing formal denfiitions of consistency models [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and data-aware
choreographies [
        <xref ref-type="bibr" rid="ref2 ref7">2,7</xref>
        ] will be considered. Formal verification based on choreography
models may also require extending the BPMN modeling language to include
information about the individual management of the exchanged data. Eventually,
the framework can be used to automatically derive enhanced process designs
when potential conflicts are identified.
      </p>
      <p>Based on this framework, a methodology will be developed to enable business
engineers to iteratively redesign interaction behaviors prone to inconsistencies.
The redesigned behavior is supposed to either ensure data consistency until
the interactions afected by the data are completed or include appropriate
compensation behavior to restore consistency. To realize the proposed concept, the
following research questions need to be answered:
– Which information is required to reason about data consistency across
multiple interactions while also considering concurrent behavior?
– How can data consistency-related information be integrated into the design
of process choreographies?
– How can the behavior of process choreographies be enhanced to avoid conflicts
caused by data inconsistencies?
4</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion</title>
      <p>This position paper discusses the need for considering the preservation of data
consistency when designing process choreographies. Since current choreography
modeling languages provide limited support for data modeling, potential conflicts
due to data inconsistencies between participants may go undetected during
design time. By integrating data consistency-related information into the design
of process choreographies, corresponding conflicts can be detected and addressed
to ensure a more reliable interaction behavior.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <article-title>Business process model and notation (BPMN), version 2</article-title>
          .0 (
          <issue>2011</issue>
          ), http://www.omg. org/spec/BPMN/2.0
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Corradini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muzi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Re</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tiezzi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Animating multiple instances in BPMN collaborations: From formal semantics to tool support</article-title>
          . In: Weske,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Montali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Weber</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          , vom Brocke, J. (eds.)
          <source>Business Process Management, Lecture Notes in Computer Science</source>
          , vol.
          <volume>11080</volume>
          , pp.
          <fpage>83</fpage>
          -
          <lpage>101</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2018</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -98648-
          <issue>7</issue>
          _
          <fpage>6</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Gilbert</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lynch</surname>
          </string-name>
          , N.:
          <article-title>Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services</article-title>
          .
          <source>ACM SIGACT News</source>
          <volume>33</volume>
          (
          <issue>2</issue>
          ),
          <fpage>51</fpage>
          -
          <lpage>59</lpage>
          (
          <year>2002</year>
          ). https: //doi.org/10.1145/564585.564601
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Haarmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Cross-case data objects in business processes: Semantics and analysis</article-title>
          . In: Fahland,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Becker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          , M. (eds.)
          <source>Business Process Management Forum, Lecture Notes in Business Information Processing</source>
          , vol.
          <volume>392</volume>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>17</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2020</year>
          ). https://doi. org/10.1007/978-3-
          <fpage>030</fpage>
          -58638-
          <issue>6</issue>
          _
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Hahn</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Breitenbu¨cher, U.,
          <string-name>
            <surname>Kopp</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leymann</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Modeling and execution of data-aware choreographies: an overview</article-title>
          .
          <source>Computer Science - Research and Development</source>
          <volume>33</volume>
          (
          <issue>3-4</issue>
          ),
          <fpage>329</fpage>
          -
          <lpage>340</lpage>
          (
          <year>2018</year>
          ). https://doi.org/10.1007/s00450-017-0387-y
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Herlihy</surname>
            ,
            <given-names>M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wing</surname>
            ,
            <given-names>J.M.:</given-names>
          </string-name>
          <article-title>Linearizability: a correctness condition for concurrent objects</article-title>
          .
          <source>ACM Transactions on Programming Languages and Systems</source>
          <volume>12</volume>
          (
          <issue>3</issue>
          ),
          <fpage>463</fpage>
          -
          <lpage>492</lpage>
          (
          <year>1990</year>
          ). https://doi.org/10.1145/78969.78972
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Knuplesch</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pryss</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Data-aware interaction in distributed and collaborative workflows: Modeling, semantics, correctness</article-title>
          . In: Pu,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Nepal</surname>
          </string-name>
          , S. (eds.)
          <source>Proceedings of the 8th IEEE International Conference on Collaborative Computing: Networking</source>
          , Applications and Worksharing. IEEE (
          <year>2012</year>
          ). https://doi.org/10.4108/icst.collaboratecom.
          <year>2012</year>
          .250443
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kopp</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wieland</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leymann</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Towards choreography transactions</article-title>
          .
          <source>In: Oliver Kopp, Niels Lohmann (eds.) 1st Central-European Workshop on Services and their Composition</source>
          ,
          <source>ZEUS</source>
          <year>2009</year>
          , Stuttgart, Germany, March 2-
          <issue>3</issue>
          ,
          <year>2009</year>
          .
          <source>Proceedings. CEUR Workshop Proceedings</source>
          , CEUR-WS.org (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Ladleif</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Modeling and enforcing blockchain-based choreographies</article-title>
          . In: Hildebrandt, T.,
          <string-name>
            <surname>van Dongen</surname>
            ,
            <given-names>B.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          ¨oglinger,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.)
          <source>Business Process Management, Lecture Notes in Computer Science</source>
          , vol.
          <volume>11675</volume>
          , pp.
          <fpage>69</fpage>
          -
          <lpage>85</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2019</year>
          ). https: //doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -26619-
          <issue>6</issue>
          _
          <fpage>7</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lamport</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Time, clocks, and the ordering of events in a distributed system</article-title>
          .
          <source>Communications of the ACM</source>
          <volume>21</volume>
          (
          <issue>7</issue>
          ),
          <fpage>558</fpage>
          -
          <lpage>565</lpage>
          (
          <year>1978</year>
          ). https://doi.org/10.1145/ 359545.359563
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lamport</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The part-time parliament</article-title>
          .
          <source>ACM Transactions on Computer Systems</source>
          <volume>16</volume>
          (
          <issue>2</issue>
          ),
          <fpage>133</fpage>
          -
          <lpage>169</lpage>
          (
          <year>1998</year>
          ). https://doi.org/10.1145/279227.279229
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Data consistency enforcement on business process transactions</article-title>
          .
          <source>In: ServiceOriented Computing</source>
          , pp.
          <fpage>394</fpage>
          -
          <lpage>399</lpage>
          . Springer Berlin Heidelberg (
          <year>2013</year>
          ). https:// doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -37804-1_
          <fpage>40</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. Meyer, A.,
          <string-name>
            <surname>Pufahl</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batoulis</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fahland</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Automating data exchange in process choreographies</article-title>
          .
          <source>Information Systems</source>
          <volume>53</volume>
          ,
          <fpage>296</fpage>
          -
          <lpage>329</lpage>
          (
          <year>2015</year>
          ). https://doi.org/10.1016/j.is.
          <year>2015</year>
          .
          <volume>03</volume>
          .008
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Nakamoto</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Bitcoin: A peer-to-peer electronic cash system (</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Tanenbaum</surname>
            , A.S., van Steen,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Distributed Systems: Principles and Paradigms</article-title>
          . Pearson
          <string-name>
            <surname>Education</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Tsoury</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sofer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reinhartz-Berger</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Data impact analysis in business processes</article-title>
          .
          <source>Business &amp; Information Systems Engineering</source>
          <volume>62</volume>
          (
          <issue>1</issue>
          ),
          <fpage>41</fpage>
          -
          <lpage>60</lpage>
          (
          <year>2020</year>
          ). https: //doi.org/10.1007/s12599-019-00611-5
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riveret</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ponomarev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendling</surname>
          </string-name>
          , J.:
          <article-title>Untrusted business process monitoring and execution using blockchain</article-title>
          . In: La Rosa,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Loos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Pastor</surname>
          </string-name>
          ,
          <string-name>
            <surname>O</surname>
          </string-name>
          . (eds.)
          <source>Business Process Management, Lecture Notes in Computer Science</source>
          , vol.
          <volume>9850</volume>
          , pp.
          <fpage>329</fpage>
          -
          <lpage>347</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2016</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -45348-4_
          <fpage>19</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Business Process Management. Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2019</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>662</fpage>
          -59432-2
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Zaha</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofstede</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barros</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
          </string-name>
          , G.:
          <article-title>Service interaction modeling: Bridging global and local views</article-title>
          .
          <source>In: 2006 10th IEEE International Enterprise Distributed Object Computing Conference (EDOC'06)</source>
          . pp.
          <fpage>45</fpage>
          -
          <lpage>55</lpage>
          . IEEE (
          <volume>10</volume>
          /16/2006 - 10/16/
          <year>2006</year>
          ). https://doi.org/10.1109/EDOC.
          <year>2006</year>
          .50
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>