<!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>Multi-Dimensional Performance Analysis and Monitoring Using Integrated Performance Spectra</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vadim Denisov</string-name>
          <email>v.denisov@tue.nl</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dirk Fahland</string-name>
          <email>d.fahland@tue.nl</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wil M.P. van der Aalst</string-name>
          <email>wvdaalst@pads.rwth-aachen.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science</institution>
          ,
          <addr-line>RWTH Aachen</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Eindhoven University of Technology</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>-In process mining, basic descriptive statistics over observed events of event logs or streams, projected onto a process model, are typically used for performance analysis. The so-called performance spectrum is used for the fine-grained description of process performance over time, additionally revealing phenomena related to the behavior of multiple cases together. The performance spectrum computed from traces aligned with a process model allows performance analysis of processes with concurrency. However, performance spectra are used to describe performance only along the case level, leaving performance analysis and monitoring of other process dimensions out of scope. This paper presents an approach and tool combining a synchronous proclet system with a performance spectrum for multi-dimensional performance real-time monitoring and post-mortem analysis. While the tool is a proof-of-concept implementation, designed for analysis of the control-flow, resource and queue dimensions of logistic processes, the presented concepts are general.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Performance analysis is an important element in process
management relying on precise knowledge about actual process
behavior and performance for enabling improvements [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and
for detecting and mitigating performance deviations in the
real-time settings [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Existing techniques project aggregated
performance diagnostics, based on descriptive statistics over
observed events of event logs or streams, onto a process model
visualization [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The common problem of those techniques
is the inability to reveal phenomena related to the behavior
of multiple cases together, such as overtaking (when a case
bypasses cases that started earlier), batching, queueing and
so on [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. As a result, causations and correlations between
instances of those phenomena cannot be revealed and analyzed,
e.g., a longer than usual average duration of a particular step
of a process cannot be explained by averages or assuming
independence of cases.
      </p>
      <p>
        To address these limitations, the so-called Performance
Spectrum (PS) was introduced in our prior work [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], and
implemented in the Performance Spectrum Miner (PSM) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        A tool integrating the PS with a Petri net model, capable of
handling concurrent processes, is presented in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. However,
both techniques [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] visualize performance only along
the case level. While this helps identifying process steps and
moments in time with performance problems, the analyst cannot
investigate the environment that causes performance problems.
      </p>
      <p>
        For example, a Material Handling System (MHS), such as an 1The source code, video and further documentation available on https:
airport Baggage Handling System (BHS), can be considered as //github.com/processmining-in-logistics/psm/tree/pqr
a network of queues and resources connected according to the
system physical layout [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The behavior of a case, e.g., a bag
(control-flow), queues, and resources lie in di erent process
dimensions that are usually studied separately. As a result, such
a separate analysis does not reveal how, for example, resource
availability a ects queue waiting times, and so on. To study
their interplay, the analyst has to understand how the
controlflow, queue, and resource dimensions are interconnected. For
that, an integrated analysis of all the dimensions is required
(Req1). In turn, this requires a process model that describes the
behavior of all the dimensions together, so that the performance
visualization along all dimensions over time is presented in an
integrated context. Industrial adoption requires simple models
that describe process dynamics using domain concepts. At the
same time, process analysts may require more precise formal
models, so a model should be visualized in two forms: (1)
as a domain-specific visualization for domain experts, and
(2) as a formal model for process analysts (Req2). Further,
understanding process performance problems has two use
cases: (1) post-mortem analysis of o ine data, e.g., for
rootcause analysis or for developing predictive models, (2) online
visualization to let operators observe performance problems at
run-time in a detailed manner. While the former is addressed
in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]–[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], the latter is not, so visualization of the
performance description over time in real-time is required
(Req3).
      </p>
      <p>We present a tool1 that allows an integrated analysis and
visualization of performance problems along the dimensions of
control-flow, queues, and resources for the domain of MHSs.</p>
      <p>
        It is a proof-of-concept implementation, which can use a
realtime event stream from the provided BHS simulation model
or a real MHS. We address the problem of multi-dimensional
performance analysis using a synchronous proclet system [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
called a PQR-system [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] that describes the Process- (P-), Queue
(Q-) and Resource (R-) dimensions of an MHS. The tool allows
to study Performance Spectra (PSa) of those dimensions in the
PSM, using a GUI of the PQR-system visualization for selecting
a required PS fragment of the required dimension to be shown.
      </p>
      <p>We mitigate the problem of understanding a process model by
aligning its layout with Material Flow Diagrams (MFDs), the
Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
(c)
bs
starta
completea
completea
starta
enqa:b
deqa:b
pid1
pid2</p>
      <p>t4
visualization widely used in the MHS domain, and by hiding
implementation details when needed. We support real-time
monitoring of the system performance by (1) token animation
over the domain specific system visualization, similar to token
animation in most process mining tools, and (2) through the
PS being updated in real-time to show how the PS-based
monitoring allows faster and more accurate analysis. Finally,
to illustrate our concept in action, we show how a
multidimensional analysis with PSa allows identifying root causes
of performance outliers.</p>
      <p>The remainder is organized as follows. Section II introduces
PQR-systems and PSa. Section III explains how the tool
satisfies the requirements of this section, and Section IV
discusses evaluation and concludes the paper.</p>
    </sec>
    <sec id="sec-2">
      <title>II. PQR-Systems and Performance Spectra</title>
      <p>(a)
a (b)
b</p>
      <p>Time</p>
      <p>Fig. 1. The MHS conveyor (a), corresponding PQR-system (b) and PS (c).</p>
      <p>In MHSs, materials (e.g., bags in BHSs) are typically moved III. Multi-Dimensional Analysis and Monitoring
by conveyors. In Fig. 1(a) the conveyor moves bags from This section is organized as follows. We first introduce the
location a to location b, the system tracks bags at those main components of the tool. Then we explain how to interpret
locations through sensors that detect the front and back sides performance spectra of P-, Q- and R-dimensions of a
PQRof each bag. We model MHSs as a synchronous proclet system system, illustrate how we adapt the visualization of the process
called a PQR-system, where the only P-proclet models the model to needs of domain experts, and consider pros and cons
conveyor layout, Q-proclets model conveyors as queues, and of performance analysis and monitoring using classical token
R-proclets model resources. The life-cycle transitions start and animation versus visualization of PSa. Finally, we formulate a
complete model how the front and back sides of a bag pass a brief guideline for performance analysis using an environment
location. A PQR-system example is shown in Fig. 1(b). The with the integrated PS and process model that implements the
P-proclet (shown in red) shows the logical layout of the system requirements of Section I.
of Fig. 1(a). The Q-proclet a : b (shown in blue) models bag
transportation as a FIFO queue with the minimal waiting time A. Tool Components
twQ. The R-proclets a, b (shown in green) model resources Our tool consists of the PQR-system, the PSM, and the
handling bags at the conveyor beginning (location a) and end optional BHS simulation model of a BHS (Fig. 2). The
PQR(location b) as a single server (R-proclet of the resource b system visualizes the process model and provides a GUI
is not shown to save space). Each resource has the minimal for filtering segments of di erent dimensions visualized by
service time tsR required for handling a case (bag), and the the PSM. The simulation model provides a GUI to control
minimal waiting time twR for becoming ready for handling the simulation scenarios and their animation. It sends each segment
next case. The channels shown by dashed lines define how occurrence to the PSM as a datagram to simulate real-time
transition occurrences of di erent proclets synchronize. As a monitoring of remote systems. In practice, the data for the tool
result, each event is a part of three traces: of a case, of a queue, can also be streamed from a real system.
and of a resource participating in the same step.</p>
      <p>
        The PS is computed for segments. A segment is a pair of B. Performance Spectra of Multiple Dimensions
activities (x; y) where y directly follows x. It describes a step As we discussed in Section I, PQR-systems describe P-,
from activity x to activity y, e.g., a bag moving from location Q- and R-dimensions. Events, generated by the simulation
x to y. Each case advancing from activity x to y generates an model, have attributes that carry identifiers for corresponding
occurrence of the segment (x; y), which is characterized by two case notions and transition labels, so the PSM can assemble
timestamps (tx; ty). In Fig. 1(c), the PS of the PQR-system of traces per case (bag), queue, and resource for computing and
Fig. 1(b) is shown. Its top segment (as; bs) contains two segment visualizing their PSa, while the PQR-system GUI allows to
occurrences of cases pid1 and pid2 with timestamps (t1; t2) choose segments to be shown.
and (t3; t4) respectively. Multiple segments can be composed Fig. 1(b) shows the PS corresponding to “normal” work,
into the detailed PS [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Fig. 1(c) additionally shows the PS i.e., without performance outliers. In contrast, Fig. 3 shows a
for segments of the queue a : b and resource a. During an “slow” bag (occurrence o1), surrounded by “faster” bags. In
occurrence of (a; b) in the P-proclet for case pid1, the resource the model, we see that either resource a or b, or queue a : b
a handles it (occurrence o11), then waits (occurrence o21) for the could cause the delay. However, considering the PS of just the
next case. As soon as the case is handled by a, it is enqueued control-flow dimension is insu cient to give a concrete answer.
into the queue a : b, where it waits (occurrence o51) for handling For that, we also analyse the PSa of the Q- and R-dimensions.
by the resource b. Case pid2 is handled similarly (occurrences We start from the PS of resource a. Each resource of a
o23, o42 and o62 correspondingly). PQR-system defines exactly one trace of its start and complete
activity events. Thus, the segment (starta; completea) represents
the serving (handling) of one bag (state busy), while the
segment (completea; starta) represents the absence of bags to
handle (state idle). In the PS, we see that the service time
of the delayed case (occurrence o2) is similar to the service
time of the surrounding cases, while the following longer idle
time (occurrence o3) indicates absence of cases to be handled.
      </p>
      <p>We conclude this resource did not cause the delay but had
to wait longer for the next case. Similarly, resource b had
to wait longer (occurrence o6) to start handling the delayed
case (occurrence o5), but the handling itself was not delayed.</p>
      <p>Further, we analyse the PS of queue a : b. Similarly to the
resources, each queue defines exactly one trace. A segment of
a queue represents an element (bag) waiting in the queue. In
the PS of queue a : b, we see the longer waiting time for the
delayed bag (occurrence o4), so the queue indeed caused this
delay. That proves also a longer waiting time of b (o6). Further
in Section III-E we will show how to identify which system
queue or resource initially caused a performance outlier.</p>
      <sec id="sec-2-1">
        <title>C. Adaptive Visualisation of PQR-systems</title>
        <p>Our simulation model also uses it to show a current location
of each bag in the system. Additionally, it highlights stopped
(blocked) conveyors in red. The PSM draws and classifies
segment occurrences as soon as the corresponding events are
generated by the system, and automatically scrolls the view
towards the latest segment occurrence. As for ongoing segments
the end activities and timestamps are not observed yet, it
estimates them only if there is no choice in the control flow,
i.e., when the end activity is known, using the observed minimal
duration of process segments.</p>
        <p>Let us first consider two screenshots of animation in the time
moments t1 and t2; t1 &lt; t2 in Fig. 4(a,b). The first screenshot
shows normal work (no stopped (red) conveyors). In the second
screenshot, the bags are not moving, because the conveyors are
stopped (red). While the states are clear, a painstaking analysis
of dozens or even hundreds of frames in between is required to
understand how and why the incident was developing between
those time moments. For processes with many cases executing
simultaneously, and with a wide range of average durations
of di erent process steps, such an approach is hardly feasible.
In contrast, the PS allows to see the performance dynamics
of the system for a time interval of interest at once, speeding
up the detection of outliers during performance analysis or
monitoring. In Fig. 4(c) we instantly see the delay in bag
handling in segments s1; s3 s9, and how it propagates through
the segments over time. As soon as an outlier is detected, the
PS analysis can reveal its root causes, as we show next.</p>
        <sec id="sec-2-1-1">
          <title>In Section I, we highlighted challenges of the use of process</title>
          <p>models in process mining tools oriented on diverse users. To
overcome them, we followed two directions: (1) making models
similar to process representations the domain experts are used
to, i.e., MFDs, and (2) hiding information that is irrelevant for
the current analysis phase or already known to the analyst.</p>
          <p>For that, we aligned the PQR-system layout with the layout
of the system MFD. In our tool, an MFD is present by the
simulation model visualization (Fig.2(a)). We repeat this layout
in our P-proclet, thereby making it easily recognizable by
everybody familiar with the MFD. Then, we assume that
implementation details of the Q- and R-proclets are extremely
useful for getting to know the PQR-system first, but verbose
afterwards. So we provide options to hide various details and
dimensions.</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>In the tool, the PQR-system and PSM are integrated into a</title>
          <p>single GUI. The PQR-system panel allows adding and removing
segments of the P-, Q- and R-dimensions to the PS in the PSM,
and the PSM allows their ordering needed for a particular
analysis. Additionally, the PSM allows navigation from a PS
segment back to the corresponding place of the PQR-system.</p>
          <p>For example, in Fig. 4(c) the PSM shows (1) process segments
s2 s9 forming a route from the BHS check-in link IN4
toward unit y S 0 diverting bags to scanner S 1, (2) resource
segments s10 and s11 representing the resource of merge unit
IN37 preceding directly diverting unit y S 0, and (3) queue
segment s12 representing the queue between those merge and
diverting units. Here we provide a basic guideline for the
analysis of performance deviations, focused on blocking (a
D. Token Animation versus Performance Spectra delay in performing of a particular process step) and high load</p>
          <p>As we discussed in Section I, token animation over a system (a higher number of cases for a process segment within a given
model is widely used for performance analysis and monitoring. time window). The guideline consists of the following steps:</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>E. Using Integrated Performance Spectra and PQR-systems</title>
        <p>1. Spotting a deviation. For that, we explore the P-proclet PS
visually, e.g., in Fig. 4(c) we see longer occurrences (blockings)
in segments s1; s3 s9, shown in orange. We select one of
them, segment s3, for the further analysis.
2. Identifying the starting segment. For that, we analyze the PS,
starting from the selected segment, against the direction of the
outlier propagation. Concretely, high load typically propagates
forward along the control flow, and blocking propagates
backward. We add each next segment, containing the same
type of deviation around the time of the previously spotted
one, to the chain of segments until the next segment does not
have deviations. The last segment of this chain had caused the
whole chain of outliers. In our example, we have the chain
hs3; : : : ; s9i. s9 is the last segment where the blocking is still
observed, so it caused the whole chain of blocking.
3. Analysing the other dimensions. For the starting segment,
we analyze the PS of the Q- and R-dimensions. For blocking,
a longer queue waiting time or a longer resource service time
can cause the delay, while for high load a higher number of
cases accumulated, for example, during a recent blocking can
cause a load peak. In our example, we study the R- and
Qdimensions for segment s9. Segment s11 (state busy) has a
long pause, i.e., it did not handle cases during the deviation
time. Segment s10 (state idle) has a single long occurrence,
i.e., a longer waiting time before the next case. Segment s12
(queue) shows multiple delayed traces whose waiting times
are longer than the waiting time of the surrounding traces, so
we conclude this queue caused the delay in s9 and the whole
chain of blocking as well.
4. Domain-specific explanation. Using domain knowledge, the
analysis results can be explain in terms of the underlying
process or system. In our example, conveyor IN37 y : y S10
could be blocked by a bag, or it could have a technical
malfunction, causing longer waiting times for all cases (bags)
located on it. In turn, the preceding conveyors were gradually
stopped one by one as they could not hand over bags to
the further (already stopped) conveyors. The red arrows in
Fig. 4(c) shows the incident development. Note, after s5
blocking propagates via merge unit IN34 x in two directions:
to s4 and s1.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>IV. Conclusion</title>
      <p>
        The tool combining PSa and MFDs was successfully
evaluated at Vanderlande for several systems and use cases, still
in the o -line mode. We showed that such an integration allows
a shallow learning curve and faster performance analysis for
domain experts. We expect further evaluations of the combined
PQR-systems and PSa for both analysis and monitoring. Our
tool still lacks automatic detection of performance patterns [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ],
projecting descriptive statistics onto the model [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and a more
robust approach for estimation of end activities and timestamps
of ongoing segments. The latter is the subject of future work.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgment</title>
      <p>The research leading to these results has received funding
from Vanderlande in the project “Process Mining in Logistics”.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Maruster</surname>
          </string-name>
          and
          <string-name>
            <surname>N. R. T. P. van Beest</surname>
          </string-name>
          , “
          <article-title>Redesigning business processes: a methodology based on simulation and process mining techniques,” Knowl</article-title>
          . Inf. Syst., vol.
          <volume>21</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>267</fpage>
          -
          <lpage>297</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>V.</given-names>
            <surname>Denisov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “
          <article-title>Predictive performance monitoring of material handling systems using the performance spectrum,” in ICPM 2019</article-title>
          . IEEE,
          <year>2019</year>
          , pp.
          <fpage>137</fpage>
          -
          <lpage>144</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <source>Process Mining - Data Science in Action, Second Edition</source>
          . Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
            , D. Tacke Genannt Unterberg,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Denisov</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Fahland</surname>
          </string-name>
          , “
          <article-title>Visualizing token flows using interactive performance spectra,” in Petri Nets 2020</article-title>
          . Cham: Springer International Publishing,
          <year>2020</year>
          , pp.
          <fpage>369</fpage>
          -
          <lpage>380</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Denisov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “
          <article-title>Unbiased, finegrained description of processes performance from event data,” in BPM 2018, ser</article-title>
          .
          <source>LNCS</source>
          , vol.
          <volume>11080</volume>
          . Springer,
          <year>2018</year>
          , pp.
          <fpage>139</fpage>
          -
          <lpage>157</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V.</given-names>
            <surname>Denisov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Belkina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst,</surname>
          </string-name>
          “
          <article-title>The performance spectrum miner: Visual analytics for fine-grained performance analysis of processes,” ser</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2196</volume>
          . CEUR-WS.org,
          <year>2018</year>
          , pp.
          <fpage>96</fpage>
          -
          <lpage>100</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Denisov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “
          <article-title>Repairing event logs with missing events to support performance analysis of systems with shared resources,” in Petri Nets 2020</article-title>
          . Cham: Springer International Publishing,
          <year>2020</year>
          , pp.
          <fpage>239</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Ma</surname>
          </string-name>
          <article-title>´rquez-</article-title>
          <string-name>
            <surname>Chamorro</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Resinas</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Ruiz-Corte´s, “Predictive monitoring of business processes: A survey,”</article-title>
          <source>IEEE Transactions on Services Computing</source>
          , vol.
          <volume>11</volume>
          , no.
          <issue>6</issue>
          , pp.
          <fpage>962</fpage>
          -
          <lpage>977</lpage>
          ,
          <year>Nov 2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          , “
          <article-title>Describing behavior of processes with many-to-many interactions,” in Petri Nets 2019, ser</article-title>
          .
          <source>LNCS</source>
          , vol.
          <volume>11522</volume>
          . Springer,
          <year>2019</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E. L.</given-names>
            <surname>Klijn</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          , “
          <article-title>Performance mining for batch processing using the performance spectrum,”</article-title>
          <source>in BPM Workshop</source>
          <year>2019</year>
          , ser.
          <source>LNBIP</source>
          , vol.
          <volume>362</volume>
          . Springer,
          <year>2019</year>
          , pp.
          <fpage>172</fpage>
          -
          <lpage>185</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>