<!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 Handling Business Process Anomalies through Artifact-based Modeling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Luciano Baresi</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Meroni</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pierluigi Plebani</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Elettronica, Informazione e Bioingegneria Piazza Leonardo da Vinci</institution>
          ,
          <addr-line>32 - 20133 Milano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Politecnico di Milano</institution>
        </aff>
      </contrib-group>
      <fpage>9</fpage>
      <lpage>16</lpage>
      <abstract>
        <p>Control ow-based process modeling notations, like BPMN, are good at de ning the normal execution ow and the management of foreseen exceptions. When unforeseen situations occur, one cannot detect if the execution is still acceptable with respect to the process de nition. In contrast, artifact-centric process modeling notations, like the GuardStage-Milestone (GSM), are better suited for this kind of scenarios: they de ne a process in terms of acceptable states and do not enforce any speci c execution ow. This improves exibility, but hampers the clarity of the de ned models. The goal of this paper is to show how an extension of GSM, i.e., E-GSM, can be used to detect deviations from the execution path as modeled in BPMN, while keeping the process execution alive.</p>
      </abstract>
      <kwd-group>
        <kwd>Process Monitoring</kwd>
        <kwd>Guard-Stage-Milestone</kwd>
        <kwd>Artifact-centric processes</kwd>
        <kwd>Handling Process Exceptions</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The cooperation and communication among di erent organizations are usually
de ned through business processes that capture the tasks performed by each
organization, their order, and the messages exchanged. To design these processes,
one usually adopts imperative modeling languages, like the Business Process
Modeling Notation (BPMN). These languages ease the de nition of the expected
execution ow and of the exceptional ows aimed to manage anomalies foreseen
at design time. However, while a process is executed, each organization has full
control only on the portion of the process that is under its responsibility. This
means that the overall, actual execution ow may di er from the one de ned
originally, and unforeseen exceptions could materialize. Moreover, one organization
can know the activities executed by the others only if they properly distribute
information about their initiation and termination.</p>
      <p>
        To alleviate these problems, this paper proposes a solution to monitor the
execution of distributed control ow-based process models based on
artifactcentric ones. We start from a BPMN process, which is easy to conceive, and we
transform it into an equivalent model in E-GSM, an extension to the
GuardStage-Milestone (GSM) artifact-centric modeling notation [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The resulting
EGSM model can be shared by the involved parties to allow them to keep track
of the order in which activities are executed and of the status of each activity.
Deviations from the \original" execution ow can easily be detected at run-time
during the process enactment.
      </p>
      <p>The paper is structured as follows. Section 2 discusses how we extended
GSM into E-GSM to enable a data-artifact driven process monitoring solution.
Section 3 gives a brief overview of the rules we de ned to translate BPMN to
E-GSM. Section 4 shows how E-GSM can be used to monitor a real business
process in the domain of logistics. After a comparison with relevant work in the
literature in Section 5, Section 6 outlines possible future work.
2</p>
      <p>
        E-GSM
The GSM notation is a declarative language that allows one to model
artifactcentric processes by de ning conditions that determine the activation and
termination of activities, called Stages, based on events. Starting from the standard
GSM notation and our preliminary work [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], we propose E-GSM, an extension
where we distinguish between Data Flow Guards (that represent the original
Guards in GSM) and Process Flow Guards, and we add Fault Loggers:
{ A Data Flow Guard is an Event-Condition-Action (ECA) rule. If true,
the associated Stage is declared opened. A Milestone is another ECA
rule. If true, the Stage is declared closed. A Milestone may also have an
invalidator : a boolean expression that can invalidate the Milestone and
reopen the Stage.
{ A Process Flow Guard is a boolean expression that predicates on the
activation of the Data Flow Guards and Milestones used to map the
expected control ow. The expression is evaluated once one of the Data
Flow Guards of the associated Stage is triggered, and before the Stage
becomes opened. If the expression is true, the Stage complies with the
expected execution, otherwise the Stage has been activated without respecting
the normal ow.
{ A Fault Logger is an ECA rule. If true, the associated Stage is declared as
faulty because something went wrong during the execution of the activity.
A faulty Stage does not imply its termination, as the termination is only
determined by Milestones.
      </p>
      <p>
        Figure 1 sketches the lifecycle of an E-GSM Stage organized around three
main orthogonal execution perspectives: status, outcome, and compliance1:
{ The Execution status captures the status of a Stage: unopened (Data Flow
Guards have never been triggered), opened (one of the Data Flow Guards
triggers) or closed (when opened, a Milestone is achieved).
1 In this paper we use the the notation introduced in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], so we write S.DFGi, S.PFGk,
S.FLl to indicate the activation of a Data Flow Guard, Process Flow Guard, or a
Fault Logger associated with Stage S, +S.Mj (-S.Mj) to indicate the achievement
(invalidation) of a Milestone Mj, S.Mj to indicate that Stage S is closed and a Milestone
Mj is achieved, and Active(S) to indicate that Stage S is opened.
      </p>
      <p>Summarizing, Data Flow Guards drive the change of status. Fault
Loggers drive the outcome, while Process Flow Guards are in charge of the
compliance. With respect to Standard GSM, E-GSM interprets reopening a closed
Stage as a new iteration of that process portion. Therefore, once a parent Stage
is reopened, the lifecycle of all its child Stages will restart from scratch.
3</p>
    </sec>
    <sec id="sec-2">
      <title>E-GSM generation</title>
      <p>
        Starting from a process modeled using BPMN { that we aim to monitor { the
generation of the corresponding E-GSM { that feeds the monitoring system {
adheres to a set of transformation rules. These rules are applicable to every BPMN
process model that complies with a work ow net [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], that is, the process has only
one start event and only one end event, and it always terminates (soundness).
      </p>
      <p>Basic transformation rules are shown in Figure 2:
(a) BPMN Activities are translated into E-GSM Stages.
(b) BPMN Start, End or Intermediate Events are translated into E-GSM Stages
where their Data Flow Guards and the Milestones are associated to the
occurrence of the event.
(c) BPMN Activities with a non-interrupting Boundary Event attached to them
are translated into E-GSM Stages as in case (a), with a Fault Logger having
the occurrence of the event as condition.
(d) BPMN Activities A with an interrupting Boundary Event attached to them
are translated into E-GSM Stages as in case (a), with an additional Milestone
and Fault Logger having the occurrence of the event as condition.</p>
      <p>
        These transformation rules allow any well-structured BPMN process model
to be translated into E-GSM. A BPMN to E-GSM prototype translator
implemented in ATL (ATLAS Transformation Language [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]), has been developed to
support the translation activities.2
      </p>
      <p>
        The combination of the above rules for basic elements allows one to translate
well-structured business process models. In particular, we focus on ve types of
blocks, de ned starting from the classical control ow patterns [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]: sequence
block, parallel block, conditional exclusive block, conditional inclusive block, loop
block. For each of these blocks a transformation rule have been de ned and a
graphical representation of some of them is reported in Figure 3. In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the
complete set of these transformation rules is discussed in details.
      </p>
      <p>For instance, a sequence block corresponds to a Stage Seq that includes Sx
inner Stages obtained by applying the transformation rules to all the elements
(i.e., Activities, Events, inner blocks) that belong to the block. Moreover, in
addition to the existing Process Flow Guards, each inner stage has Sx.PFG1 to state
that none of its Milestones is achieved, and at least one of the Milestones of the
element that directly precedes it (if present) is achieved. This way, inner Stages
are expected to be opened only once, and only after their direct predecessor is
closed. Finally, Seq has a set Seq.DFG that includes all Sx.DFGi, and a Milestone
Seq.M1 that requires that, for all Sx, at least one Sx.Mj be achieved. This way,
Seq is opened when at least one of its Sx is opened too, and { as achieving a
Milestone is enough to close a Stage { Seq is closed when all Sx are closed.
4</p>
    </sec>
    <sec id="sec-3">
      <title>E-GSM in action</title>
      <p>To better clarify how E-GSM models can be used to monitor the execution of
complex (distributed) processes, here we concentrate on an example taken from
2 The tool is publicly available at https://bitbucket.org/polimiisgroup/
bpmn2egsm.
the logistics domain. A manufacturing company M has to ship its goods to one of
its customers N and, to do so, it relies on a shipping company S for rail and
seacargo transportation, and on a shipping company T for truck transportation. The
shipping process comprises four main phases: (i) loading goods into a shipping
container; (ii) shipping such a container to an intermediate site A by truck; (iii)
depending on the day of the week, shipping the goods to either site B by rail,
or to site C by sea; (iv) delivering the goods to the customer's site by truck.
Furthermore, if part of the goods drops during the loading phase, that activity
should stop, all involved actors should be noti ed of such an accident, and then
the loading phase redone. Figure 4 shows the BPMN de nition of this process
in the upper part, and the derived E-GSM process, which is produced by our
translator, in the lower part.</p>
      <p>The resulting E-GSM model de nition feeds an E-GSM engine that is able to
check the evolution of the lifecycle of the Stages. We assume that a smart device
embeds this engine and travels along with the goods. Using on-board sensors, or
via explicit messages sent by an operator, the engine is able to determine when
E-GSM elements that decorate each Stage are triggered, and to log information
on each Stage along with the execution status, outcome and compliance
perspectives: Data Flow Guards allow the parties to realize when activities are
started, Milestones when they end, Fault Loggers if they were not correctly
executed, and Process Flow Guards if they are compliant with the de ned
control ow.</p>
      <p>Let us suppose that the shipping process is carried out as follows: the process
starts on Wednesday, when T carefully loads the goods onto their truck at M 's
site (when the loading phase is complete, the operator sends a message making
LoadGoods.M1 achieved) and ships them to site A on Thursday. Once the goods
arrive at A, ShipToA.M1 is achieved. Before taking the goods from T , S queries
the smart device to verify that the activities LoadGoods and ShipToA have been
correctly performed, and then the goods are exchanged. Being Thursday, S ships
the goods to site C by sea. Finally, T delivers the goods to N 's site, where
N queries the smart device to have information on how the process has been
enacted. In this case, since the execution ow has been respected (i.e., every
time a Stage was opened, the conditions on its process ow guards have been
satis ed), and no Fault Logger has been triggered, N accepts the goods.</p>
      <p>Let us now focus on a process execution where the designed control ow
is not respected. For instance, during the initial loading, part of the goods is
dropped. However, T ignores that accident and the shipping process continues
as planned. This cause the veri cation of the FaultLogger LoadGoods.FL1, that
moves LoadGoods to the faulty outcome. Once N receives the goods, it discovers
that some of them are damaged, and returns them to M . By querying the smart
device, M immediately identi es that the goods have been dropped (i.e., the
condition on LoadGoods.FL1 has been satis ed), that ShipToA started while
LoadGoods was still in progress, and that the accident has not been noti ed (i.e.,
NotifyAccident has not been executed even though NotifyAccident.PFG1 was
satis ed). Thank to these information, M is able to charge T a penalty for the
damaged goods, and to impose it to ship the new goods to N for free.</p>
      <p>A third example shows how the system can handle unforeseen exceptions. In
this case, the shipping to site A takes longer than expected and the goods arrive
there on Sunday. Nevertheless, S ships the goods by sea to site C. This causes a
signi cant delay and a waste of resources since the goods are expected to arrive
at B and, once their current location is identi ed, a truck must bring them from
site B to C. Again, the information collected by the smart device allows N to
identify that ShipToC does not comply with the model: ShipToC is executed
instead of ShipToB, and ShipToC has been opened even though ShipToC.PFG1
was not satis ed. Moreover, by knowing that ShipToC is currently running, M
can blame S as the responsible for this ine ciency. If the smart device is also
equipped with a communication interface, it can autonomously send information
to all involved parties. This allows T to gure out that ShipToC is in progress
and be ready to pick up the goods at site C instead of B.</p>
      <p>
        These examples demonstrate how E-GSM can be used to e ectively
monitor the execution of a distributed process, especially in case of processes where
several actors are involved and no central orchestrator is imposed. While an
EGSM engine is not available yet, an extension of the Barcelona GSM engine [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
is currently under development.
5
      </p>
    </sec>
    <sec id="sec-4">
      <title>Related Work</title>
      <p>
        Modeling business processes with declarative languages is generally more di cult
than with imperative ones as proved by Pichler et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. For this reason,
and also because of the need for reusing excerpts of preexisting process models,
there have been some attempts to develop methods and solutions to translate
imperative languages into declarative ones.
      </p>
      <p>
        Kopke et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] start from a BPMN process model and produce a GSM
equivalent that forces the process to behave exactly as de ned in the BPMN
model. While we have borrowed the Stage nesting, our rules di er signi cantly
from the ones in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], mainly due to the fact that the purpose of our work is
completely di erent. In particular, we are interested in identifying control ow
violations, and not in forcing the process to rigidly follow a given execution ow,
which is what is pursued in this work.
      </p>
      <p>
        Eshuis et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] de ne a semi-automated approach to produce GSM
models starting from UML Activity Diagrams, while Kumaran et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] propose
a language-agnostic algorithm to derive the lifecycle of artifacts based on an
imperative process model. With respect to our work, which keeps control ow
information in the target process model to assess compliance, [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] use such
information to model the interactions among data artifacts.
      </p>
      <p>
        Popova et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] de ne a translator from Petri Nets to GSM to transform
the outcome of process mining algorithms, which is often represented as a Petri
Net, in a language easier to understand by domain experts.
6
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>In this paper we proposed an extension of the Guard-Stage-Milestone (GSM)
notation to embed control ow information in the process model de nition to
enable the translation from BPMN models into equivalent E-GSM ones. The
resulting declarative process can drive the process monitoring to check anomalies
during the execution of the process. Future work will concentrate on how to verify
the soundness of the derived E-GSM processes and the level of equivalence with
respect to the original BPMN process. As E-GSM has been studied to drive
a exible monitoring system, tools for distributing and running E-GSM-driven
monitoring on smart devices will be proposed.</p>
      <p>Acknowledgments. This work has been partially funded by the Italian Project
ITS Italy 2020 under the Technological National Clusters program.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Van der Aalst</surname>
          </string-name>
          , W.M.:
          <article-title>Veri cation of work ow nets</article-title>
          .
          <source>In: Application and Theory of Petri Nets</source>
          <year>1997</year>
          , pp.
          <volume>407</volume>
          {
          <fpage>426</fpage>
          . Springer (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baresi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meroni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plebani</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>A gsm-based approach for monitoring crossorganization business processes using smart objects (2015), accepted for publication</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Eshuis</surname>
            , R., Van Gorp,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Synthesizing data-centric models from business process models</article-title>
          .
          <source>Computing</source>
          pp.
          <volume>1</volume>
          {
          <issue>29</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Heath</surname>
            <given-names>III</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>F.T.</given-names>
            ,
            <surname>Boaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Vacul</surname>
          </string-name>
          <string-name>
            <given-names>n</given-names>
            , R.,
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Hull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Limonad</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>Barcelona: A design and runtime environment for declarative artifact-centric bpm</article-title>
          .
          <source>In: Service-Oriented Computing</source>
          , pp.
          <volume>705</volume>
          {
          <fpage>709</fpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Hull</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Damaggio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fournier</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heath</surname>
            , Fenno(Terry),
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hobson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linehan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maradugu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nigam</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sukaviriya</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vaculin</surname>
          </string-name>
          , R.:
          <article-title>Introducing the guard-stage-milestone approach for specifying business entity lifecycles</article-title>
          .
          <source>In: Web Services and Formal Methods, Lecture Notes in Computer Science</source>
          , vol.
          <volume>6551</volume>
          , pp.
          <volume>1</volume>
          {
          <fpage>24</fpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Jouault</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Allilaire</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bezivin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurtev</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Atl: A model transformation tool</article-title>
          .
          <source>Science of computer programming 72(1)</source>
          ,
          <volume>31</volume>
          {
          <fpage>39</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. Kopke, J.,
          <string-name>
            <surname>Su</surname>
          </string-name>
          , J.:
          <article-title>Towards ontology guided translation of activity-centric processes to gsm (2015), accepted for publication</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kumaran</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.Y.</surname>
          </string-name>
          :
          <article-title>On the duality of information-centric and activitycentric models of business processes</article-title>
          .
          <source>In: Advanced Information Systems Engineering</source>
          . pp.
          <volume>32</volume>
          {
          <fpage>47</fpage>
          . Springer (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Meroni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baresi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plebani</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Translating BPMN to E-GSM:
          <article-title>speci cations and rules</article-title>
          .
          <source>Tech. rep., Politecnico di Milano</source>
          (
          <year>2016</year>
          ), http://hdl.handle.
          <source>net/ 11311/976678</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Pichler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zugal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pinggera</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendling</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reijers</surname>
            ,
            <given-names>H.A.</given-names>
          </string-name>
          :
          <article-title>Imperative versus declarative process modeling languages: An empirical investigation</article-title>
          .
          <source>In: Business Process Management Workshops</source>
          . pp.
          <volume>383</volume>
          {
          <fpage>394</fpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Popova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>From petri nets to guard-stage-milestone models</article-title>
          .
          <source>In: Business Process Management Workshops</source>
          . pp.
          <volume>340</volume>
          {
          <fpage>351</fpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofstede</surname>
            ,
            <given-names>A.H.M.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mulyar</surname>
          </string-name>
          , N.:
          <article-title>Work ow control ow patterns: A revised view</article-title>
          .
          <source>Tech. Rep. BPM-06-22</source>
          , BPM Center Report, BPMcenter.org (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>