<!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>Leveraging frequencies in event data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sander J.J. Leemans</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>RWTH</institution>
          ,
          <addr-line>Aachen</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Process mining aims to obtain insights from event logs. In this extended abstract, we will show that it is useful to take the frequency perspective (that is, stochastic behaviour) into account, and will discuss several stochastic process mining techniques. Organisations run on processes: processing an order, onboarding a new hire, getting travel approval; many work performed in organisations can be considered as processes. Process mining aims to optimise these processes through event logs: records of executions of processes, typically obtained from information systems that support the processes. Figure 1 shows an overview the context and common tasks of process mining. A process is running in an organisation, and through information systems an event log is recorded. Using a process discovery technique, a process model can be discovered. Process discovery techniques need to trade-of several potentially competing model quality aspects, such as readability and filtering noise. Ideally, a process model would be compared to the actual process, however as that is assumed to be unknown, this relation can only be theoretically proven under certain assumptions, or estimated. Rather, in practice a model should be compared to (a separate test) event log, for instance on the quality dimensions of simplicity, fitness - the fraction of behaviour in the event log that is in the process model, and precision - the fraction of behaviour of the model that was observed in the event log. A process model expresses a set of potential traces that the model supports, and it may be dificult to fully interpret insights gained from such a model by itself. Therefore, in process mining projects, the model is typically enhanced with frequency or performance information, after which the project may continue with repeated drill-down filters, hypotheses and verification [ 1]. In more advanced settings, process models can be</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;process mining</kwd>
        <kwd>stochastic process mining</kwd>
        <kwd>stochastic process discovery</kwd>
        <kwd>stochastic conformance checking</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>?
process
prove/estimate
conformance</p>
      <p>event log
execute</p>
      <p>enhance
discover
check
conformance
process
model
simulation</p>
      <p>
        analysis
recommendation
simulated. This provides a baseline for, after applying certain changes, comparing
process redesigns in a what-if analysis. Finally, if process mining is integrated into daily
operations, process models can be used to recommend interventions for traces that are
still in the process [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Frequencies in process mining: the stochastic perspective</title>
      <p>Let us consider two event logs:</p>
      <p>L1 = [⟨register, check, accept⟩10000,</p>
      <p>L2 = [⟨register, check, accept⟩9500,
⟨register, check, reject⟩10000,
⟨register, accept⟩1]
⟨register, check, reject⟩9500
⟨register, accept⟩1001]
These logs have an equivalent control flow: the set of traces in both logs is the same.
However, it is obvious that these logs are not from the same process: in L1, ⟨register, accept⟩
occurs once, while in L2 it occurs more than a thousand times. Any process mining
techniques ignoring the stochastic perspective will consider these logs as to come from
the Thus, these logs are diferent mostly because of their frequencies; in process models,
we refer to this as the stochastic perspective.</p>
      <p>The stochastic perspective is obviously present in a process: behaviour has a certain
likelihood of appearing. Consequently, an event log derived from a process also has a
stochastic perspective: behaviour has a certain likelihood of being recorded in the event
log. Thus, the stochastic perspective is there.</p>
      <p>
        On th right side of Figure 1, we need an idea of how often behaviour occurs in order to
perform analysis: it matters whether behaviour is exceptional or common, and average
performance measures are weighted by definition on the multiplicity of behaviour. For
simulation, simulation software needs to know how likely each path or decision in the
process is. Similarly, recommendation needs to be aware of how likely behaviour is in
order to steer towards more likely favourable outcomes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Thus, the most useful parts
of process mining need the stochastic perspective. This leaves an obvious gap between
the stochastic-having event logs and the stochastic-needing analysis, simulation and
recommendation: process models with a stochastic perspective: stochastic process models.
A stochastic process model not only expresses what behaviour can happen, but also how
likely each trace is.
      </p>
      <sec id="sec-2-1">
        <title>2.1. Analysis, simulation &amp; recommendation</title>
        <p>
          Without existing stochastic process models, existing analysis, simulation and
recommendation techniques, which inherently use the stochastic perspective, must obtain this
stochastic information in an ad-hoc fashion from the event log [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ]. Consequently, such
techniques have no idea of the quality of the stochastic perspective they operate on and
risk testing on their training logs, which is not good practice. Without explicit stochastic
information, one cannot write it down, cannot reason about it, and adjust it in process
redesign eforts.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Precision</title>
        <p>Another area where considering stochastic process information is beneficial is in the
evaluation of process models: we already discussed fitness, and most fitness measures
take the stochastic information into account implicitly: the more likely behaviour in
the log, the higher its influence on the fitness measure. Precision measures express the
fraction of behaviour of the model that was seen in the event log:
precision = |model ∩ log|
|model|
An inherent problem with this intuitive informal definition is that one needs a count of
behaviour in the model. One cannot simply count traces, as models may express infinitely
much behaviour through loops.</p>
        <p>
          We illustrate this for one non-stochastic precision technique [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This approach considers
the outgoing edges of the state space of a model: they divide the number of edges taken
by the total number of edges to arrive at a number. However, these techniques do
not consider at all what lies beyond edges that were seen in the model. Thus, unseen
behaviour is only counted proportionally to the number of edges that go into that area,
irrespective of the “size” of the unseen part [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>For a stochastic process model, this is not a problem as we have a notion of size: in
the state space, it is known exactly how likely each edge is, and that is exactly equal to
the size – the probability mass – of the model that lies behind it. Thus, for stochastic
process models more intuitive precision measures can be defined.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Reliability of conclusions</title>
        <p>
          If we consider Figure 1 again, inaccuracies or imprecisions can be introduced at many
steps of these common process mining tasks:
• When recording the event log from a process, the quality of the recording may vary,
or extraction may be biased;
• When discovering a process model, a process discovery technique may need to make
well-known trade-ofs between potentially competing quality criteria;
• When estimating the quality of a process model with respect to the process,
assumptions and bias may be tested based on a process model [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ];
• When comparing a process model with an event log using a conformance checking
technique, such a technique will try to squeeze a trace from the log onto the
bestiftting path through the model [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]; There might be multiple such best-fitting paths,
and there is no guarantee that a best-fitting path is the most likely explanation,
yielding ambiguities and potentially inaccuracies;
• When enhancing a process model for analysis, simulation or recommendation,
behaviour where log and model do not agree on (non-conforming parts) needs to
be handled [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>
          All of these steps may be sources of inaccuracies and imprecisions, which may propagate
and aggregate over a process mining project. We conjecture that the use of stochastic
process models makes it easier to quantify and study these inaccuracies and imprecisions,
such that the reliability of conclusions can be quantified [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], and improved.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Existing stochastic process mining techniques</title>
      <p>Next, we discuss some stochastic process mining techniques that mimic standard
nonstochastic techniques: stochastic process discovery and stochastic conformance checking.
Furthermore, we discuss completely new types of techniques that require considering
stochastic process behaviour.</p>
      <sec id="sec-3-1">
        <title>3.1. Stochastic process discovery</title>
        <p>
          In stochastic process discovery, the aim is to automatically discover a stochastic process
model – such as a stochastic labelled Petri net [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] – from an event log. Most stochastic
process mining techniques take an existing non-stochastic process model and construct
a stochastic process perspective on top if it. For instance, [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] constructs a stochastic
perspective through time: it estimates the delay distribution of process steps, which in
turn determines their likelihood. Another approach constructs a stochastic perspective for
a process model using several estimators, ranging from simple counting to alignments [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
        </p>
        <p>
          A technique that does not start from an existing is [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], which starts from the behaviour
in the event log and using reduction rules compacts, summarises and abstracts the
stochastic behaviour until a suitable model remains.
        </p>
        <p>
          A completely diferent approach is taken by [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], which constructs declarative
constraints on the log, such that these constraints hold with a certain likelihood. As such,
these models describe multiple options for stochastic behaviour, rather than a single
stochastic language.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Stochastic conformance checking</title>
        <p>
          A stochastic conformance checking technique compares with one another an event log
and a stochastic process model, or two stochastic process models, or two event logs.
Stochastic entropy [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] consists of two measures: recall is the entropy of the common
behaviour of log and model – minimal number of bits required to describe the behaviour –
divided by the entropy of the log. Precision is then the entropy of the common behaviour
of the log and model divided by the entropy of the model.
        </p>
        <p>
          Another stochastic conformance checking technique is the Earth Movers’ Distance [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ],
which considers both log and model (or any other combination; loops need to be unfolded)
as distributions over traces, and then applies the Wasserstein distance principle, which
ifnds the least-cost way to transform one dstribution into the other. That is, both
distributions are piles of earth, and the distance says how much earth – trace probability
mass – need to be transported over what distance – trace diference – in order to transform
one pile into the other. Besides a single conformance number, this measure can also
provide detailed insights when projected on a model.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Goodies</title>
        <p>Next to stochastic extensions of techniques, the concept of stochastic process behaviour
has enabled some new types of analyses and techniques.</p>
        <p>
          Some event logs have hundreds of activities, which make them challenging to analyse.
A way to simplify models is to apply a trace-based filter, thereby focusing the analysis on,
for instance, platinum customers, or orders with a value over a certain amount. Cohort
analysis recommends filters based on the diference between traces that pass the filter and
all the other traces: the filter that is associated with the largest diference in stochastic
behaviour would simplify the model the most [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>
          Most process mining insights are associational. However, as in associational insights
there is no diference between cause and efect, for redesign or what-if analyses it is
beneficial to perform causal reasoning. Recent studies have introduced causal reasoning:
to discover causal rules from event logs [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], to discover causal relations between decisions
in a process model [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], and to perform root-cause analysis [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. All of these techniques
are inherently enabled by the concept of stochastic process behaviour.
        </p>
        <p>
          Further techniques targeting stochastic behaviour are the detection of diferences in
a stochastic process over time (concept drift) [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]; to discover anomalies in event logs
without the use of process models [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]; and the combination of data-aware and stochastic
process models [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>Process mining is an exciting field of research. In this pledge for consideration of
the stochastic perspective of process behaviour, we have shown several challenges of
process mining concepts and techniques that may benefit from having a stochastic
perspective. Several recent stochastic process mining techniques were discussed, both
dropin replacements for well-known process discovery and conformance checking techniques,
as well as new techniques that leverage the stochastic perspective of behaviour of event
logs to enable new types of analysis.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>M. L. van Eck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>PM ^2 : A process mining project methodology</article-title>
          , in: J.
          <string-name>
            <surname>Zdravkovic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kirikova</surname>
          </string-name>
          , P. Johannesson (Eds.),
          <source>Advanced Information Systems</source>
          Engineering - 27th International Conference, CAiSE
          <year>2015</year>
          , Stockholm, Sweden, June 8-12,
          <year>2015</year>
          , Proceedings, volume
          <volume>9097</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2015</year>
          , pp.
          <fpage>297</fpage>
          -
          <lpage>313</lpage>
          . URL: https: //doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -19069-3_
          <fpage>19</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -19069-3\_
          <fpage>19</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Shoush</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <article-title>When to intervene? prescriptive process monitoring under uncertainty and resource constraints</article-title>
          ,
          <source>CoRR abs/2206</source>
          .07745 (
          <year>2022</year>
          ). URL: https://doi.org/10.48550/arXiv.2206.07745. doi:
          <volume>10</volume>
          .48550/arXiv. 2206.07745. arXiv:
          <volume>2206</volume>
          .
          <fpage>07745</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>I.</given-names>
            <surname>Verenich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <article-title>Predicting process performance: A white-box approach based on process models</article-title>
          ,
          <source>J. Softw. Evol. Process</source>
          .
          <volume>31</volume>
          (
          <year>2019</year>
          ). URL: https://doi.org/10.1002/smr.2170. doi:
          <volume>10</volume>
          .1002/smr.2170.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Exploring processes and deviations</article-title>
          ,
          <source>in: BPM Workshops</source>
          , volume
          <volume>202</volume>
          <source>of LNBIP</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>304</fpage>
          -
          <lpage>316</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Adriansyah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Munoz-Gama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Carmona</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. F. van Dongen</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Measuring precision of modeled behavior, Inf</article-title>
          . Syst.
          <string-name>
            <given-names>E</given-names>
            <surname>Bus</surname>
          </string-name>
          . Manag.
          <volume>13</volume>
          (
          <year>2015</year>
          )
          <fpage>37</fpage>
          -
          <lpage>67</lpage>
          . URL: https://doi.org/10.1007/s10257-014-0234-7. doi:
          <volume>10</volume>
          .1007/ s10257-014-0234-7.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Janssenswillen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Depaire</surname>
          </string-name>
          ,
          <article-title>Towards confirmatory process discovery: Making assertions about the underlying system</article-title>
          ,
          <source>Bus. Inf. Syst. Eng</source>
          .
          <volume>61</volume>
          (
          <year>2019</year>
          )
          <fpage>713</fpage>
          -
          <lpage>728</lpage>
          . URL: https://doi.org/10.1007/s12599-018-0567-8. doi:
          <volume>10</volume>
          .1007/s12599-018-0567-8.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Adriansyah</surname>
            ,
            <given-names>B. F. van Dongen</given-names>
          </string-name>
          ,
          <article-title>Replaying history on process models for conformance checking and performance analysis</article-title>
          ,
          <source>WIREs Data Mining Knowl. Discov</source>
          .
          <volume>2</volume>
          (
          <year>2012</year>
          )
          <fpage>182</fpage>
          -
          <lpage>192</lpage>
          . URL: https://doi.org/10.1002/widm.1045. doi:
          <volume>10</volume>
          .1002/widm.1045.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Goel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Wynn</surname>
          </string-name>
          ,
          <article-title>Quality-informed process mining: A case for standardised data quality annotations</article-title>
          ,
          <source>ACM Trans. Knowl. Discov. Data</source>
          <volume>16</volume>
          (
          <year>2022</year>
          )
          <volume>97</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>97</lpage>
          :
          <fpage>47</fpage>
          . URL: https://doi.org/10.1145/3511707. doi:
          <volume>10</volume>
          .1145/3511707.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rogge-Solti</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , M. Weske,
          <article-title>Discovering stochastic petri nets with arbitrary delay distributions from event logs</article-title>
          , in: N.
          <string-name>
            <surname>Lohmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Song</surname>
          </string-name>
          , P. Wohed (Eds.),
          <string-name>
            <surname>Business Process Management Workshops - BPM 2013 International Workshops</surname>
          </string-name>
          , Beijing, China,
          <year>August 26</year>
          ,
          <year>2013</year>
          ,
          <string-name>
            <given-names>Revised</given-names>
            <surname>Papers</surname>
          </string-name>
          , volume
          <volume>171</volume>
          <source>of Lecture Notes in Business Information Processing</source>
          , Springer,
          <year>2013</year>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>27</lpage>
          . URL: https: //doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -06257-
          <issue>0</issue>
          _2. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -06257-0\_2.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Burke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          , M. T. Wynn,
          <article-title>Stochastic process discovery by weight estimation</article-title>
          , in: S.
          <string-name>
            <surname>J. J. Leemans</surname>
          </string-name>
          , H. Leopold (Eds.),
          <string-name>
            <surname>Process Mining</surname>
          </string-name>
          Workshops - ICPM 2020 International Workshops, Padua, Italy, October 5-
          <issue>8</issue>
          ,
          <year>2020</year>
          , Revised Selected Papers, volume
          <volume>406</volume>
          <source>of Lecture Notes in Business Information Processing</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>260</fpage>
          -
          <lpage>272</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -72693-5_
          <fpage>20</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -72693-5\_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Burke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          , M. T. Wynn,
          <article-title>Discovering stochastic process models by reduction and abstraction</article-title>
          , in: D.
          <string-name>
            <surname>Buchs</surname>
          </string-name>
          , J. Carmona (Eds.),
          <source>Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS</source>
          <year>2021</year>
          ,
          <string-name>
            <given-names>Virtual</given-names>
            <surname>Event</surname>
          </string-name>
          , June 23-25,
          <year>2021</year>
          , Proceedings, volume
          <volume>12734</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2021</year>
          , pp.
          <fpage>312</fpage>
          -
          <lpage>336</lpage>
          . URL: https://doi.org/10. 1007/978-3-
          <fpage>030</fpage>
          -76983-3_
          <fpage>16</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -76983-3\_
          <fpage>16</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Montali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Peñaloza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alman</surname>
          </string-name>
          ,
          <article-title>Extending temporal business constraints with uncertainty</article-title>
          , in: D.
          <string-name>
            <surname>Fahland</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Ghidini</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Becker</surname>
          </string-name>
          , M. Dumas (Eds.),
          <source>Business Process Management - 18th International Conference, BPM</source>
          <year>2020</year>
          , Seville, Spain,
          <source>September 13-18</source>
          ,
          <year>2020</year>
          , Proceedings, volume
          <volume>12168</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2020</year>
          , pp.
          <fpage>35</fpage>
          -
          <lpage>54</lpage>
          . URL: https://doi.org/10.1007/ 978-3-
          <fpage>030</fpage>
          -58666-
          <issue>9</issue>
          _3. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -58666-9\_3.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Polyvyanyy</surname>
          </string-name>
          ,
          <article-title>Stochastic-aware conformance checking: An entropy-based approach</article-title>
          , in: S.
          <string-name>
            <surname>Dustdar</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Salinesi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Rieu</surname>
          </string-name>
          , V. Pant (Eds.),
          <source>Advanced Information Systems</source>
          Engineering - 32nd International Conference, CAiSE
          <year>2020</year>
          , Grenoble, France, June 8-12,
          <year>2020</year>
          , Proceedings, volume
          <volume>12127</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2020</year>
          , pp.
          <fpage>217</fpage>
          -
          <lpage>233</lpage>
          . URL: https: //doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -49435-3_
          <fpage>14</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -49435-3\_
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
            , T. Brockhof,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Polyvyanyy</surname>
          </string-name>
          ,
          <article-title>Stochastic process mining: Earth movers' stochastic conformance</article-title>
          ,
          <source>Inf. Syst</source>
          .
          <volume>102</volume>
          (
          <year>2021</year>
          )
          <article-title>101724</article-title>
          . URL: https://doi.org/10.1016/j.is.
          <year>2021</year>
          .
          <volume>101724</volume>
          . doi:
          <volume>10</volume>
          .1016/j.is.
          <year>2021</year>
          .
          <volume>101724</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shabaninejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Goel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Khosravi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Sadiq</surname>
          </string-name>
          , M. T. Wynn,
          <article-title>Identifying cohorts: Recommending drill-downs based on diferences in behaviour for process mining</article-title>
          , in: G. Dobbie, U. Frank, G. Kappel,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Liddle</surname>
          </string-name>
          , H. C. Mayr (Eds.),
          <source>Conceptual Modeling - 39th International Conference, ER 2020</source>
          , Vienna, Austria, November 3-
          <issue>6</issue>
          ,
          <year>2020</year>
          , Proceedings, volume
          <volume>12400</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2020</year>
          , pp.
          <fpage>92</fpage>
          -
          <lpage>102</lpage>
          . URL: https://doi.org/10.1007/ 978-3-
          <fpage>030</fpage>
          -62522-
          <issue>1</issue>
          _7. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -62522-1\_7.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Z. D.</given-names>
            <surname>Bozorgi</surname>
          </string-name>
          , I. Teinemaa,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Polyvyanyy</surname>
          </string-name>
          ,
          <article-title>Process mining meets causal machine learning: Discovering causal rules from event logs</article-title>
          , in: ICPM, IEEE,
          <year>2020</year>
          , pp.
          <fpage>129</fpage>
          -
          <lpage>136</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tax</surname>
          </string-name>
          ,
          <article-title>Causal reasoning over control-flow decisions in process models</article-title>
          , in: X.
          <string-name>
            <surname>Franch</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Poels</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Gailly</surname>
          </string-name>
          , M. Snoeck (Eds.),
          <source>Advanced Information Systems</source>
          Engineering - 34th International Conference, CAiSE
          <year>2022</year>
          , Leuven, Belgium, June 6-10,
          <year>2022</year>
          , Proceedings, volume
          <volume>13295</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2022</year>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>200</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>031</fpage>
          -07472-1_
          <fpage>11</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -07472-1\_
          <fpage>11</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Qafari</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Root cause analysis in process mining using structural equation models</article-title>
          ,
          <source>in: BPM Workshops</source>
          , volume
          <volume>397</volume>
          <source>of LNBIP</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brockhof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Uysal</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Time-aware concept drift detection using the earth mover's distance</article-title>
          , in: B. F. van
          <string-name>
            <surname>Dongen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montali</surname>
          </string-name>
          , M. T. Wynn (Eds.),
          <source>2nd International Conference on Process Mining, ICPM</source>
          <year>2020</year>
          , Padua, Italy, October 4-
          <issue>9</issue>
          ,
          <year>2020</year>
          , IEEE,
          <year>2020</year>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>40</lpage>
          . URL: https://doi.org/10.1109/ ICPM49681.
          <year>2020</year>
          .
          <volume>00016</volume>
          . doi:
          <volume>10</volume>
          .1109/ICPM49681.
          <year>2020</year>
          .
          <volume>00016</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>Nolle</surname>
          </string-name>
          ,
          <article-title>Process learning for process autonomous anomaly correction (extended abstract)</article-title>
          , in: W. M. P. van der Aalst,
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Dijkman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Leotta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. T.</given-names>
            <surname>Pentland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Senderovich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sepúlveda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. S.</given-names>
            <surname>Asensio</surname>
          </string-name>
          , M. Weske (Eds.),
          <source>Proceedings of the Best Dissertation Award, Doctoral Consortium, and Demonstration &amp; Resources Track at BPM</source>
          <year>2021</year>
          co
          <article-title>-located with 19th International Conference on Business Process Management (BPM</article-title>
          <year>2021</year>
          ), Rome, Italy, September 6th - to - 10th,
          <year>2021</year>
          , volume
          <volume>2973</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>6</fpage>
          -
          <lpage>10</lpage>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2973</volume>
          /paper_137.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>F.</given-names>
            <surname>Stertz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mangler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rinderle-Ma</surname>
          </string-name>
          ,
          <article-title>Data-driven improvement of online conformance checking</article-title>
          ,
          <source>in: 24th IEEE International Enterprise Distributed Object Computing Conference, EDOC</source>
          <year>2020</year>
          , Eindhoven,
          <source>The Netherlands, October 5-8</source>
          ,
          <year>2020</year>
          , IEEE,
          <year>2020</year>
          , pp.
          <fpage>187</fpage>
          -
          <lpage>196</lpage>
          . URL: https://doi.org/10.1109/EDOC49727.
          <year>2020</year>
          .
          <volume>00031</volume>
          . doi:
          <volume>10</volume>
          .1109/EDOC49727.
          <year>2020</year>
          .
          <volume>00031</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>