<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Measuring, Analyzing and Managing Process Complexity (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maxim Vidgof</string-name>
          <email>maxim.vidgof@wu.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Vienna University of Economics and Business (WU Wien)</institution>
          ,
          <addr-line>Welthandelsplatz 1, 1020 Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Business Process Management (BPM) is pivotal in improving organizational operations, yet struggles with the inherent complexity of business processes that can escalate costs and reduce eficiency and adaptability. This dissertation thoroughly investigates process complexity from three distinct perspectives: measuring, analyzing, and managing it. It introduces novel metrics based on graph entropy that capture multiple dimensions such as size, variation, and distance, augmenting it with the data perspective, enhancing understanding of process complexity. Innovative event log filtering techniques and log-delta analysis tools are developed to facilitate deeper insights and examine the impact of complexity on business performance. Furthermore, it advances managing complexity by integrating modern technological strategies, including a process scripting language and using Large Language Models in BPM. These contributions provide substantial implications for academia and practitioners, ofering tools and strategies to manage process complexity efectively, thereby optimizing workflows and boosting operational performance.</p>
      </abstract>
      <kwd-group>
        <kwd>Process complexity</kwd>
        <kwd>Process mining</kwd>
        <kwd>Process automation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Business Process Management (BPM) focuses on optimizing organizational work, aiming to
ensure consistent outcomes and capitalize on opportunities for improvement [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Central to
BPM is managing the inherent complexity of business processes in order to enhance
operational eficiency and competitiveness. Complexity in business processes manifests in various
executions, leading to increased costs, reduced eficiency, and decreased adaptability, negatively
impacting an organization’s growth potential. Event logs play a crucial role in this context,
serving as repositories of data that capture the detailed executions and intricate dynamics of
business processes. However, existing research uses perceptual and model-based metrics to
assess complexity of business processes, while event log complexity is mainly represented by
simplistic count-based approaches. Moreover, analyzing event logs requires sophisticated
techniques and efort to extract meaningful insights. Additionally, process automation emerges as a
powerful tool in mitigating complexity, utilizing modern technology to streamline operations,
reduce errors, and enhance process consistency.
2024.
https://complex.wu.ac.at/nm/vidgof (M. Vidgof)
      </p>
      <p>© 2024 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).</p>
      <p>This dissertation delves into process complexity from three angles: measuring, analyzing, and
managing. Measuring complexity involves developing metrics that capture the multifaceted
nature of business processes, utilizing event logs that provide empirical data on process executions.
Analyzing complexity uses these metrics to evaluate the impact on process performance and
explores event log filtering techniques and tools like log-delta analysis to gain deeper insights.
Managing complexity includes employing process automation and innovative technologies like
Large Language Models .</p>
    </sec>
    <sec id="sec-3">
      <title>2. Background</title>
      <p>
        Complexity in organizations manifests in various forms and can be classified into organizational,
technological and textual complexity [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. These complexities are often addressed through
metrics developed by organizational sciences, software engineering, and linguistics. Process
complexity is related to all three of complexity types. Process models help to understand
intricate business processes, logs capture dynamic data during process execution, and textual
complexity arises from documentation and communication within an organization. As processes
change over time due to both external and internal factors, leading to changes in the operational
paths and potential outcomes, so does process complexity, showing interesting patterns [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ].
Efective management of this dynamic complexity requires balancing standardization, which
simplifies processes by reducing variability, and flexibility, allowing organizations to adapt
to new challenges and maintain eficiency in face of evolving conditions, and often involve
automation of processes.
      </p>
      <sec id="sec-3-1">
        <title>2.1. Model complexity</title>
        <p>
          Process complexity refers to the dificulty in analyzing, understanding, or explaining a process,
influenced by factors like the intricacy of activity interfaces, transitions, and data structures [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Typically, the complexity of a business process model is quantified by the number of elements
and their interrelations, impacting understandability. Automated discovery of process models,
for instance, often yields spaghetti models that, despite capturing a broad spectrum of behaviors,
are of limited practical value due to their complexity.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Event log complexity</title>
        <p>
          Event logs record state changes during business process execution, facilitating deep insights
into process performance and compliance, and are essential input for process mining. Process
mining algorithms have led to the development of basic complexity measures, originating from
ifelds like computer science and management science. Complexity measures are divided into
four categories: size measures focus on countable log attributes like the number of events and
sequence lengths [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]; variation measures analyze process behavior variations using methods
like the Lempel–Ziv algorithm to assess event log compression [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]; distance measures include
concepts such as afinity and edit distances between event sequences to evaluate complexity [
          <xref ref-type="bibr" rid="ref6 ref7">6,
7</xref>
          ]; and graph entropy measures, introduced in this dissertation, apply sequence and variant
entropy to quantify complexity taking all above aspects into consideration.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>2.3. Process automation</title>
        <p>
          Process automation is essential in modern business management, leveraging information
technology to optimize and streamline operations through the configuration of IT systems to support
tasks, assign responsibilities, and perform automated cross-checks. Central to this is the use of
Process-Aware Information Systems (PAISs), which can be domain-specific, such as ERP and
CRM systems , or domain-agnostic, like Issue Tracking systems and Document Management
Systems. A central tool in this sphere is the Business Process Management System (BPMS),
which aids in the design, execution, and monitoring of business processes [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. BPMS not only
automates traditional manual tasks, thus enhancing eficiency and productivity, but also ensures
precise process execution which is crucial in a compliance-focused business environment. Task
automation within a BPMS involves a careful selection of tasks for automation, integrating
primarily manual tasks with technology, and creating a hybrid system that combines human
intuition with machine eficiency. Other technologies, such as Robotic Process Automation
(RPA), further contribute to process automation by operating on the user interface, similarly to
human workers.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Approach</title>
      <p>This dissertation, consisting of seven contributions, tackles the complexity of business processes
from three perspectives—measuring, analyzing, and managing—guided by the following research
questions:</p>
      <sec id="sec-4-1">
        <title>RQ1. How can process complexity be measured based on event logs?</title>
        <p>RQ2. How can process complexity and its impact on process characteristics be analyzed?</p>
      </sec>
      <sec id="sec-4-2">
        <title>RQ2.1. How can process complexity be analyzed?</title>
        <p>RQ2.2. How can impact of complexity on process performance be analyzed?</p>
      </sec>
      <sec id="sec-4-3">
        <title>RQ3. How can modern technology help tackle process complexity?</title>
      </sec>
      <sec id="sec-4-4">
        <title>RQ3.1. How can complexity of business processes be reduced? RQ3.2. How can complex processes be handled?</title>
        <p>
          Utilizing algorithm engineering [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] as the main research method, it employs a systematic
approach that combines experimental evaluations on both synthetic and real-world data with
formal analysis to develop eficient, real-world applicable algorithms. Algorithm engineering
is the method of choice for all the contributions listed below, except for the last one, which
follows an exploratory approach.
        </p>
        <p>
          This dissertation addresses RQ1 by exploring process complexity measures in event logs. First,
an entropy-based complexity metric is introduced [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. This metric allows for direct comparison
between logs of diferent business processes and accounts for all three perspectives of event log
complexity: size, variation and distance. Then, the correlation between log complexity metrics
and the quality of process models derived through process mining is studied. The proposed
metric is then further enhanced by incorporating event data [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. This enables a more nuanced
measurement of event log complexity, providing insights that are inaccessible with traditional
metrics, which focus only on the control flow.
        </p>
        <p>
          Next, RQ2 is addressed by the analysis of process complexity. An advanced multi-range
event log filtering technique is introduced, allowing for more control on which behavior is
included in the filtered event log [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Building upon that, a novel log-delta analysis tool is
developed, which allows filtering on more parameters and enables side-by-side comparison of
sub-logs [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Then, the connection between the complexity of business processes and their
time performance is studied by developing explanatory regression models [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>
          Finally, RQ3 is explored by presenting strategies for managing business process complexity
through innovative automation techniques. This includes the development of a process scripting
language designed to simplify automating complex business processes [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and the exploration
of Large Language Models (LLMs) in Business Process Management [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. The latter proposes
the use of advanced natural language processing techniques to manage process complexity,
promoting more sophisticated and efective BPM strategies.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Conclusion</title>
      <p>Complexity in business processes is critical for operational performance and agility, and
understanding this complexity is crucial as business environments evolve. This dissertation studies
complexity of business processes from three perspectives: measuring, analyzing and managing
it. It significantly advances research on process complexity and process mining, proposing
and evaluating new quantitative complexity measures for event logs and applying them to
explain time performance of business processes. The research provides a strong foundation for
evidence-based complexity measurement alongside existing perceptual and model complexity
measures, also equipping practitioners with tools to monitor the complexity and its efects on
the business process, allowing for more thorough consideration of standardization and
optimization strategies. Additionally, it introduces advanced event log filtering techniques to ensure
comprehensive data analysis and novel interactive tools for precise control in analyzing process
behaviors, giving the practitioners a more complete view of the processes, which is especially
relevant for evaluating conformance and compliance. Furthermore, the work underscores the
importance of automation in BPM by proposing a new scripting language to enhance process
modeling and automation, which gives the practitioners a readily available tool for creating
executable process models, as well as suggesting the integration of Large Language Models for
automation of tasks along the BPM lifecycle, paving the way for conversational and natural
language-based automation of BPM tasks.</p>
      <p>Future work could enhance existing complexity measures by complementing event log
complexity measures with other perspectives, such as perceptual and model complexity measures, to
investigate potential synergies and discrepancies between them. Incorporating data complexity,
which currently relies on domain knowledge, could be standardized. Exploring the relationships
between process complexity and other characteristics like the accuracy of predictive process
monitoring or the average throughput time ofers a fertile ground for research, potentially
employing simulations within tools like InterLog for what-if analyses. Additionally, further
investigation of the applications of Large Language Models in BPM could lead to innovative
strategies for managing process complexity.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <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>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Reijers</surname>
          </string-name>
          , Fundamentals of Business Process Management,
          <source>Second Edition</source>
          , Springer,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Revina</surname>
          </string-name>
          , Ü. Aksu,
          <string-name>
            <given-names>V. G.</given-names>
            <surname>Meister</surname>
          </string-name>
          ,
          <article-title>Method to address complexity in organizations based on a comprehensive overview</article-title>
          ,
          <source>Inf</source>
          .
          <volume>12</volume>
          (
          <year>2021</year>
          )
          <article-title>423</article-title>
          . URL: https://doi.org/10.3390/info12100423. doi:
          <volume>10</volume>
          .3390/info12100423.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B. T.</given-names>
            <surname>Pentland</surname>
          </string-name>
          , P. Liu,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kremser</surname>
          </string-name>
          , T. Haerem,
          <article-title>The dynamics of drift in digitized processes</article-title>
          ,
          <source>MIS Q</source>
          .
          <volume>44</volume>
          (
          <year>2020</year>
          ).
          <article-title>URL: https://misq.org/the-dynamics-of-drift-in-digitized-processes</article-title>
          .html.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>B.</given-names>
            <surname>Wurm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Grisold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. vom Brocke</surname>
          </string-name>
          ,
          <article-title>Measuring fluctuations of complexity in organizational routines</article-title>
          ,
          <source>in: Academy of Management Proceedings</source>
          , volume
          <volume>2021</volume>
          ,
          <article-title>Academy of Management Briarclif Manor</article-title>
          , NY
          <volume>10510</volume>
          ,
          <year>2021</year>
          , p.
          <fpage>13388</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cardoso</surname>
          </string-name>
          ,
          <article-title>How to measure the control-flow complexity of web processes and workflows</article-title>
          ,
          <source>Workflow handbook</source>
          <year>2005</year>
          (
          <year>2005</year>
          )
          <fpage>199</fpage>
          -
          <lpage>212</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Günther</surname>
          </string-name>
          ,
          <article-title>Process mining in flexible environments</article-title>
          ,
          <source>Ph.D. thesis, Technische Universiteit Eindhoven</source>
          ,
          <year>2009</year>
          . doi:
          <volume>10</volume>
          .6100/IR644335.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B. T.</given-names>
            <surname>Pentland</surname>
          </string-name>
          ,
          <article-title>Conceptualizing and measuring variety in the execution of organizational work processes</article-title>
          ,
          <source>Management Science</source>
          <volume>49</volume>
          (
          <year>2003</year>
          )
          <fpage>857</fpage>
          -
          <lpage>870</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Depaire</surname>
          </string-name>
          , H. Leopold,
          <article-title>Theory and practice of algorithm engineering</article-title>
          ,
          <source>CoRR abs/2107</source>
          .10675 (
          <year>2021</year>
          ). URL: https://arxiv.org/abs/2107.10675. arXiv:
          <volume>2107</volume>
          .
          <fpage>10675</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Augusto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wurm</surname>
          </string-name>
          ,
          <article-title>The connection between process complexity of event sequences and models discovered by process mining</article-title>
          ,
          <source>Information Sciences 598</source>
          (
          <year>2022</year>
          )
          <fpage>196</fpage>
          -
          <lpage>215</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <article-title>Leveraging event data for measuring process complexity</article-title>
          ,
          <source>in: International Conference on Process Mining</source>
          , Springer,
          <year>2022</year>
          , pp.
          <fpage>84</fpage>
          -
          <lpage>95</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Djurica</surname>
          </string-name>
          , S. Bala, J. Mendling,
          <article-title>Cherry-picking from spaghetti: Multi-range ifltering of event logs</article-title>
          ,
          <source>in: Enterprise, Business-Process and Information Systems Modeling: 21st International Conference, BPMDS</source>
          <year>2020</year>
          , 25th International Conference,
          <source>EMMSAD 2020, Held at CAiSE</source>
          <year>2020</year>
          , Grenoble, France, June 8-9,
          <year>2020</year>
          , Proceedings 21, Springer,
          <year>2020</year>
          , pp.
          <fpage>135</fpage>
          -
          <lpage>149</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Djurica</surname>
          </string-name>
          , S. Bala, J. Mendling,
          <article-title>Interactive log-delta analysis using multi-range ifltering</article-title>
          ,
          <source>Software and Systems Modeling</source>
          <volume>21</volume>
          (
          <year>2022</year>
          )
          <fpage>847</fpage>
          -
          <lpage>868</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wurm</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Mendling,</surname>
          </string-name>
          <article-title>The impact of process complexity on process performance: A study using event log data</article-title>
          ,
          <source>in: International Conference on Business Process Management</source>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>413</fpage>
          -
          <lpage>429</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Waibel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schimak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Seik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Queteschiner</surname>
          </string-name>
          ,
          <article-title>A code-eficient process scripting language</article-title>
          , in: International Conference on Conceptual Modeling, Springer,
          <year>2020</year>
          , pp.
          <fpage>174</fpage>
          -
          <lpage>188</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vidgof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bachhofner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <article-title>Large language models for business process management: Opportunities and challenges</article-title>
          , in: International Conference on Business Process Management, Springer,
          <year>2023</year>
          , pp.
          <fpage>107</fpage>
          -
          <lpage>123</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>