<!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>Business Process Intervention Discovery and Decision Support</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jakob De Moor</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Systems Engineering Research Group (LIRIS), KU Leuven</institution>
          ,
          <addr-line>Naamsestraat 69, Leuven</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <fpage>14</fpage>
      <lpage>18</lpage>
      <abstract>
        <p>Prescriptive Process Monitoring (PresPM) leverages machine learning to optimize business process outcomes by recommending real-time interventions. Two common approaches for recommending interventions in PresPM are Causal Inference (CI) and Reinforcement Learning (RL). Despite progress in these fields, significant gaps remain, including the lack of comprehensive comparisons of PresPM methods, the assumption of predefined intervention points and dimensions, limited handling of complex interventions (e.g., sequential interventions), and insuficient exploration of process interdependencies. This research proposes addressing these challenges by designing a simulator that generates synthetic data mimicking complex business processes, enabling the evaluation of approaches across diverse intervention types. Additionally, a novel causal decision point discovery algorithm will be developed, tailored for PresPM in business settings. The study also aims to enhance CI and RL techniques for safe and eficient handling of sequential interventions, decision timing, and process interdependencies. These contributions will be validated using both synthetic and real-world datasets, advancing the field of PresPM by providing novel methodologies for complex optimization problems.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Prescriptive Process Monitoring</kwd>
        <kwd>Process Optimization</kwd>
        <kwd>Causal Discovery</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction and background</title>
      <p>AI-powered systems in Prescriptive Process Monitoring (PresPM) ofer transformative opportunities for
businesses by enhancing decision-making. PresPM uses machine learning to analyze event log data
from business processes, uncovering relationships between process variables and targets like delivery
times, loan acceptance, patient recovery, product availability, or default rates. These systems try to
optimize outcomes by prescribing real-time interventions, such as machine maintenance, customer
calls, or loan application cancellations. Benefits include improved product and service quality, cost
savings, and increased staf satisfaction.</p>
      <p>
        After a thorough review of the literature, it is evident that two approaches for recommending
interventions are generally adopted: Causal Inference (CI) and Reinforcement Learning (RL). CI comprises
two primary subfields. The first, known as Causal Discovery (CD), focuses on identifying causal
relationships between variables. Its goal is to uncover the true causal structure of the data, typically
represented as a graph. An algorithm is said to solve the CD problem if it converges to the true structure
as the sample size increases. In Process Mining (PM), CD techniques are often used to pinpoint decision
points within a business process. The second subfield is concerned with estimating the efect of a
treatment, often denoted by the Individual Treatment Efect (ITE) in a particular data instance. Current
CI approaches in PresPM primarily concentrate on this second subfield, which can be divided into
two categories: direct and indirect CI. Direct CI entails training a machine learning model to directly
estimate the ITE of an intervention [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. Indirect CI involves training models to predict the next
executed activities for each possible action in the intervention. The ITE is then inferred based on the
obtained outcomes of the activity predictions [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In general, CI approaches are originally designed
for non-sequential intervention optimization problems. Reinforcement Learning (RL) is the other
widely adopted approach in PresPM, where an RL agent learns an optimal policy by interacting with an
environment and receiving rewards. While RL has shown promising results in controlled settings [
        <xref ref-type="bibr" rid="ref2 ref5">2, 5</xref>
        ],
real-world online training and implementation poses risks due to its exploratory nature. For example, a
bank would avoid using an RL agent for real-time loan approvals because the agent might make risky
or random decisions during its exploration phase.
      </p>
      <p>
        Despite the establishment of these initial approaches, many limitations in PresPM remain. Firstly,
there is a lack of extensive comparisons of PresPM methodologies. To the best of my knowledge,
no study has thoroughly and comprehensively compared multiple approaches. Additionally, existing
methods are typically focused on a narrow range of intervention types and limited complexity, often
neglecting more complex optimization problems. As described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], interventions can be classified by
action width (scope of intervention actions) and action depth (timing and sequence of the intervention).
Most research handles interventions with binary action width and fixed action depth [
        <xref ref-type="bibr" rid="ref1 ref3 ref6">1, 3, 6</xref>
        ], though
some consider multi-class action width [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or non-fixed action depth [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Sequential interventions
remain unexplored, and no approach has been tested or compared across multiple intervention types. A
second major issue concerns the inaccuracy in method evaluation. Current research predominantly
relies on real-life ofline data [
        <xref ref-type="bibr" rid="ref1 ref3 ref4 ref6 ref7">1, 3, 4, 6, 7</xref>
        ], which can be incomplete due to data-gathering policies, such
as a bank’s loan application policy, thereby omitting parts of the optimization state space. Evaluating
a model’s policy on a case-by-case basis requires knowledge of the outcomes under the prescribed
actions, which is infeasible with only historical data as it lacks the counterfactual outcomes, i.e., the
outcome under an alternative action than the one recorded. Thirdly, most PresPM methodologies
assume predefined intervention points. The CD aspect of CI, essential for identifying these points, is
overlooked in PresPM, despite extensive research in the PM and CI fields [
        <xref ref-type="bibr" rid="ref10 ref11 ref8 ref9">8, 9, 10, 11</xref>
        ]. Understanding
data relations in a PresPM system is crucial for identifying interventions and their dimensions, and
selecting appropriate prescriptive techniques. The last research gap concerns process interdependencies.
Real-world process executions frequently exhibit interdependencies, where one execution influences
another. For instance, in a manufacturing facility, if one production process requires a large portion of
the available machinery, it can limit the eficiency of other processes occurring simultaneously. Despite
the prevalence of these relationships, a limited number of PresPM papers address them [
        <xref ref-type="bibr" rid="ref3 ref5">3, 5</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Research Objectives and Methodology</title>
      <p>To address the identified gaps in the research section, I propose the following research objectives:</p>
      <sec id="sec-2-1">
        <title>2.1. Design and implement a simulator for PresPM</title>
        <p>
          Current PresPM research lacks comprehensive comparisons because it omits complex interventions
and a wide range of evaluation perspectives. To address this, I propose a synthetic data generator in
Python. Building on [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], the generator will produce data mimicking a loan application process in a
bank. It will be able to calculate target variables for every possible action of an intervention, addressing
the limitations of historical ofline data that lack counterfactual outcomes. The generator will support
comparisons across diferent intervention types and complexities, expanding PresPM research to more
complex optimization problems (i.e., intervention sequences). It will also facilitate experimentation
within each intervention type by varying generating parameters. To validate the generator, I will
implement and compare both CI and RL approaches, along with benchmarking existing methods. This
will allow me to determine whether the simulator can efectively and accurately highlight the diferences
between methods for varying levels of complexity. It will mark the first time a sequential intervention is
addressed and the first comprehensive comparison of existing PresPM implementations. A key challenge
will be balancing the need to maintain variability and complexity similar to real-life event logs, while
also keeping the simulated loan application process simple enough for easy interpretation and method
comparison. This balance may involve trade-ofs. Although applying methods to simulated data will
likely only approximate their performance on real-life logs, the simulator’s ability to accurately evaluate
method performance for diferent intervention decision problems makes it a valuable tool for PresPM
research.
        </p>
        <p>
          Although simulators in process mining have seen significant advancements in research [
          <xref ref-type="bibr" rid="ref12 ref13 ref14">12, 13, 14</xref>
          ],
our simulator will be uniquely designed for testing and developing PresPM approaches. It will focus on
key aspects such as (multiple) intervention types, precise evaluation, and the flexibility to customize
parameters for experimentation. Additionally, it will support the implementation of both online methods
(e.g., RL) and ofline methods (e.g., CI), enabling the generation of both real-time environments and
ofline datasets.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Develop a causal decision point discovery algorithm for Prescriptive Process</title>
      </sec>
      <sec id="sec-2-3">
        <title>Monitoring in business settings</title>
        <p>
          Current prescriptive approaches often assume predetermined intervention points and dimensions,
lacking a systematic methodology for identification. To address this, I will explore and tailor CD methods
for PresPM in business settings. One research avenue is the exploration of various PM techniques, such
as methods that incorporate structural equation models as described in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], upper-bound causal graphs
as discussed in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], uplift trees as researched in [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], and the P-MInD framework [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. To adapt these
techniques for use with PresPM, it is essential to enhance them by incorporating the identification of
intervention point dimensions (action width and action depth). These dimensions reflect the complexity
of the problem, and understanding them is essential for selecting the most appropriate optimization
method. I will additionally investigate methods to incorporate expert knowledge to improve CD. The
evaluation will include two components: synthetic data, where the true causal structure is known, and
real-world datasets to assess practical applicability.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.3. Develop novel PresPM algorithms, enhancing CI and RL</title>
        <p>Current PresPM methodologies overlook complex intervention problems, such as sequential
optimization and process interdependencies. I aim to adapt PresPM approaches to address these advanced
Machine Learning tasks.</p>
        <p>
          First, I aim to extend CI to handle intricate sequential tasks, considering challenges like decision
timing. This includes exploring optimal threshold optimization algorithms [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and sequence prediction
techniques for prescribing a series of decisions. Current research in CI beyond PresPM includes methods
for sequential decision-making, such as those proposed by [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. However, these approaches are still
in their early stages and need to be adapted to handle more complex business processes, which often
feature multiple execution paths, loops, and parallel activities. To address process interdependencies, I
will explore the integration of CI with enhanced heuristics [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and Object-Centric PM to analyze the
behavior of individual objects [17]. I will investigate whether an object-centric perspective can improve
the performance of PresPM methods.
        </p>
        <p>
          Additionally, I will adapt RL to these complex optimization challenges, e.g., intervention sequences
and process interdependencies, by improving its training eficiency. I will limit the RL action space to
decision points identified by my CD techniques and explore eficient sampling methods [ 18]. The aim is to
evaluate the suitability and efectiveness of these techniques for optimizing complex business processes.
Incorporating heuristics in RL will also be investigated to manage the increased search space. To ensure
real-world applicability of these adaptations, I will mitigate risks in online RL training by exploring
ofline RL techniques. These include using process discovery to construct training environments [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ],
constraining RL to known state spaces using nearest neighbor approaches, and leveraging predictive
models for anticipating next states [19]. The objective is to determine which techniques for building
ofline environments are best suited to diferent types of business process data and optimization
challenges. I will also identify low-risk application domains and implement predefined rules to prevent
excessively risky actions by the RL agent.
        </p>
        <p>The novel methods will first be evaluated using the previously developed simulator that can generate
all potential outcomes of a case, allowing for a thorough and accurate assessment. Afterward, the
practical applicability of these methods will be validated using real-world datasets, ideally across various
diverse business settings.
[17] W. M. P. van der Aalst, Object-centric process mining: Unraveling the fabric of real processes,</p>
        <p>Mathematics (2023).
[18] V. Mai, K. Mani, L. Paull, Sample eficient deep reinforcement learning via uncertainty estimation,
arXiv preprint arXiv:2201.01666 (2022).
[19] S. Levine, A. Kumar, G. Tucker, J. Fu, Ofline reinforcement learning: Tutorial, review, and
perspectives on open problems, arXiv (2020).</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dasht Bozorgi</surname>
          </string-name>
          , I. Teinemaa,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Polyvyanyy</surname>
          </string-name>
          ,
          <article-title>Prescriptive process monitoring based on causal efect estimation</article-title>
          ,
          <source>Information Systems</source>
          (
          <year>2023</year>
          ). doi: https://doi. org/10.1016/j.is.
          <year>2023</year>
          .
          <volume>102198</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Weytjens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Verbeke</surname>
          </string-name>
          , J. De Weerdt,
          <article-title>Timed process interventions: Causal inference vs. reinforcement learning</article-title>
          , in: J.
          <string-name>
            <surname>De Weerdt</surname>
          </string-name>
          , L. Pufahl (Eds.),
          <source>Business Process Management Workshops</source>
          , Springer Nature Switzerland, Cham,
          <year>2024</year>
          , pp.
          <fpage>245</fpage>
          -
          <lpage>258</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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>
          , in: C. Di
          <string-name>
            <surname>Ciccio</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Dijkman</surname>
            ,
            <given-names>A. del Río</given-names>
          </string-name>
          <string-name>
            <surname>Ortega</surname>
          </string-name>
          , S. Rinderle-Ma (Eds.),
          <source>Business Process Management Forum</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>207</fpage>
          -
          <lpage>223</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Weinzierl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dunzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zilker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matzner</surname>
          </string-name>
          ,
          <article-title>Prescriptive business process monitoring for recommending next best actions</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 Forum</source>
          , Springer International Publishing, Cham,
          <year>2020</year>
          , pp.
          <fpage>193</fpage>
          -
          <lpage>209</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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>Prescriptive process monitoring under resource constraints: A reinforcement learning approach</article-title>
          , arXiv (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>I.</given-names>
            <surname>Teinemaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tax</surname>
          </string-name>
          , M. de Leoni,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <article-title>Alarm-based prescriptive process monitoring</article-title>
          , in: M.
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montali</surname>
            ,
            <given-names>I. Weber</given-names>
          </string-name>
          , J. vom Brocke (Eds.),
          <source>Business Process Management Forum</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>91</fpage>
          -
          <lpage>107</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Branchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Massimo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ronzani</surname>
          </string-name>
          ,
          <article-title>Learning to act: A reinforcement learning approach to recommend the best next activities</article-title>
          , in: C. Di
          <string-name>
            <surname>Ciccio</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Dijkman</surname>
            ,
            <given-names>A. del Río</given-names>
          </string-name>
          <string-name>
            <surname>Ortega</surname>
          </string-name>
          , S. Rinderle-Ma (Eds.),
          <source>Business Process Management Forum</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>137</fpage>
          -
          <lpage>154</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Qafari</surname>
          </string-name>
          , W. van der Aalst,
          <article-title>Root cause analysis in process mining using structural equation models</article-title>
          , in: A.
          <string-name>
            <surname>Del Río Ortega</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Leopold</surname>
            ,
            <given-names>F. M.</given-names>
          </string-name>
          <string-name>
            <surname>Santoro</surname>
          </string-name>
          (Eds.),
          <source>Business Process Management Workshops</source>
          , Springer International Publishing, Cham,
          <year>2020</year>
          , pp.
          <fpage>155</fpage>
          -
          <lpage>167</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <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 Engineering</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>200</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>C.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Causal discovery from temporal data</article-title>
          ,
          <source>in: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</source>
          , KDD '23,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2023</year>
          , p.
          <fpage>5803</fpage>
          -
          <lpage>5804</lpage>
          . URL: https://doi.org/10.1145/3580305.3599552. doi:
          <volume>10</volume>
          .1145/3580305.3599552.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>J. De Smedt</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Hasić</surname>
          </string-name>
          , S. K. vanden
          <string-name>
            <surname>Broucke</surname>
          </string-name>
          , J. Vanthienen,
          <article-title>Holistic discovery of decision models from process execution data, Knowledge-Based Systems (</article-title>
          <year>2019</year>
          ). doi:https://doi.org/10. 1016/j.knosys.
          <year>2019</year>
          .
          <volume>104866</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>O.</given-names>
            <surname>López-Pintado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Berx</surname>
          </string-name>
          , Discovery, simulation, and
          <article-title>optimization of business processes with diferentiated resources</article-title>
          ,
          <source>Information Systems</source>
          <volume>120</volume>
          (
          <year>2024</year>
          )
          <article-title>102289</article-title>
          . URL: https://www. sciencedirect.com/science/article/pii/S0306437923001254. doi:https://doi.org/10.1016/j. is.
          <year>2023</year>
          .
          <volume>102289</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Maldonado</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. M. M. Frey</surname>
            ,
            <given-names>G. M.</given-names>
          </string-name>
          <string-name>
            <surname>Tavares</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Rehwald</surname>
          </string-name>
          , T. Seidl, Gedi:
          <article-title>Generating event data with intentional features for benchmarking process mining</article-title>
          , in: A.
          <string-name>
            <surname>Marrella</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Resinas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Jans</surname>
          </string-name>
          , M. Rosemann (Eds.),
          <source>Business Process Management</source>
          , Springer Nature Switzerland, Cham,
          <year>2024</year>
          , pp.
          <fpage>221</fpage>
          -
          <lpage>237</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Pourbafrani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vasudevan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xingran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>A python extension to simulate petri nets in process mining</article-title>
          ,
          <year>2021</year>
          . arXiv:
          <volume>2102</volume>
          .
          <fpage>08774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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. La</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>
          ,
          <source>in: 2020 2nd International Conference on Process Mining (ICPM)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>129</fpage>
          -
          <lpage>136</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICPM49681.
          <year>2020</year>
          .
          <volume>00028</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>I.</given-names>
            <surname>Bica</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Alaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jordon</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. van der Schaar</surname>
          </string-name>
          ,
          <article-title>Estimating counterfactual treatment outcomes over time through adversarially balanced representations</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>