<!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>A General Framework for Predictive Business Process Monitoring</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ilya Verenich</string-name>
          <email>ilya.verenich@qut.edu.au</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Supervisors: Marlon Dumas</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marcello La Rosa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabrizio Maria Maggi</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arthur ter Hofstede</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Queensland University of Technology</institution>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Tartu</institution>
          ,
          <country country="EE">Estonia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>As organizations gain awareness of the potential business value locked in their process execution event logs, \evidence-based" business process management (BPM) becomes a common tool for process analysts. In contrast to traditional process monitoring techniques which are typically performed using data from running process instances only, predictive evidence-based BPM methods tap also into historical data, to allow process workers to respond, in real-time, to speci c process performance issues and compliance violations as they arise or even before they arise. In previous work, various approaches have been proposed to address typical predictive process monitoring problems, such as whether a running process instance will meet its performance targets, or when will an instance be nally nished. However, these approaches are rather ad-hoc and lack generality, as they tackle only particular, pre-de ned aspects of predictive monitoring and often only work with speci c characteristics of the dataset. The proposed research project aims at developing a general and robust framework for predictive process monitoring that will address a variety of process monitoring tasks such as predicting the outcome of individual activities or of the whole process instance, or predicting the completion path of an instance.</p>
      </abstract>
      <kwd-group>
        <kwd>Business process management</kwd>
        <kwd>process mining</kwd>
        <kwd>business activity monitoring</kwd>
        <kwd>predictive monitoring</kwd>
        <kwd>machine learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Business process monitoring and controlling includes activities wherein data
related to the process execution are collected and analyzed to assess the process
performance with respect to its performance criteria.</p>
      <p>Traditional approaches to process monitoring and controlling rely on
\postmortem" (o ine) analysis of process execution or runtime observations of process
work by process analysts. The former includes a family of techniques known
as process intelligence, which takes as input a database of completed process
cases and outputs process performance insights, such as identi ed bottlenecks or
historical cycle times. In comparison, business activity monitoring is performed
at runtime and takes as input an event stream, i.e. pre xes of running process
cases. The output of the business activity monitoring is a real-time picture of
the process performance, such as current process load or cases running late.</p>
      <p>
        These techniques, while being able to provide estimations of the process
performance, are reactive in nature, meaning that they detect process issues
only once they have occurred. Predictive process monitoring aims to address
the limitations of traditional \empiric" monitoring practices by systematically
utilizing data produced during the process execution to continuously monitor the
processes performance [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In other words, predictive process performance can
be seen as an extension of the traditional business activity monitoring that taps
also into historical data to allow process participants to steer the execution of the
process by taking preemptive actions to achieve the desired process objectives
(Figure 1).
      </p>
      <p>Business activity
monitoring</p>
      <p>Process Monitoring and</p>
      <p>Controlling
online
Event stream
Predictive process
monitoring</p>
      <p>offline
Event logs</p>
      <p>Process
intelligence</p>
      <p>
        At the core of every predictive process monitoring system are prediction
models that are built for speci c prediction goals based on the event log L of
completed cases (Figure 2). These models are applied to pre xes p of running
cases in order to make predictions about their future performance. If the
predicted outcome deviates from the expected (normal) process behavior, alerts are
issued to notify the process participants. Additionally, recommendations can be
issued to the process workers, advising them of the impact of a speci c action
on the probability that the current case will violate the performance objectives.
Therefore, problems are anticipated and can be proactively managed. For
example, in a freight transportation process a prediction goal can be the occurrence
of delay in delivery time. In this case, the outcome will be whether the delay is
going to occur (or probability of delay occurrence). If a delay is predicted, faster
means of transport or alternative transport routes could be scheduled proactively
and before the delay actually occurs [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>The rest of the paper is organized as follows. In Section 2, we summarize
state of the art of predictive process monitoring. In Section 3 we indicate a
research gap and formulate the problem to be solved, along with the research
questions to be addressed and research criteria for the evaluation. Section 4
provides an overview of the proposed research plan. Next, Section 5 summarizes
the progress so far and features a discussion on the preliminary results. Finally,
Section 6 concludes the paper and discusses future work.</p>
      <p>Prediction outcome(s)
Event logs L
Ongoing case p</p>
      <p>Prediction goal(s)</p>
      <p>
        Prediction model(s)
Predictive process monitoring has recently received signi cant interest, due to
the widespread adoption of work ow management systems with event logging
capabilities, as well as due to advances in process mining techniques. In this
section we classify the proposed techniques based on the prediction goal they
address, i.e. time-related predictions, predictions of an outcome of a process
instance and predictions of the process instance continuation or characteristics
thereof.
The rst group of works dealing with time-related predictions approaches them
as a sequence classi cation problem, focusing on deadline violations and delayed
process executions. For example, Pika et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] make predictions about
timerelated process risks, by identifying and exploiting indicators observable in event
logs that a ect the likelihood of violating speci ed deadlines. Suriadi et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
present an approach for root cause analysis, wherein decision trees are used to
identify the causes of overtime faults. Metzger et al. [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ] present a technique for
predicting \late show" events (i.e. delays between the expected and the actual
time of arrival) in a freight transportation process.
      </p>
      <p>
        Other research proposals have approached time-related predictions as a
regression problem to predict the remaining processing time and cycle time of a
process instance. For instance, van der Aalst et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] apply annotated
transition systems in order to: (i) check time conformance of running cases, (ii) predict
their remaining processing time, and (iii) recommend actions to process workers
to ensure the conformance with time objectives. Polato et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] re ne this
approach with the addition of classi ers and regressors, which make use of event
attributes, as annotations. Rogge-Solti [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] uses stochastic Petri nets for
predicting the remaining execution time of a process, taking into account elapsed time
since the last observed process event. Folino et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] develop an ad-hoc
predictive clustering approach to facilitate the prediction of remaining processing
times, as well as service-level agreement (SLA) violations, expressed as overtime
faults. Senderovich et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] applied queue mining techniques to predict delays
in case executions.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Predictions of Process Outcome</title>
      <p>
        Here one group of works focuses on predicting the occurrence of various kinds of
process faults. For instance, Kang et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] propose an approach for predicting
abnormal termination of business processes based on k-nearest neighbor
algorithm. Conforti et al. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] propose a technique to predict process-related risks,
measured as the likelihood and the severity of negative outcome (fault)
occurrence. Risks are predicted by traversing through decision trees generated from
the logs of past process executions. Accordingly, the process participants are
advised of actions to take to mitigate the potential negative outcome or minimize
its probability.
      </p>
      <p>
        An outcome of a process case can also be de ned with respect to compliance
with prede ned rules (e.g. \every purchase order should eventually be followed
by an invoice issue") or service level agreements (e.g. \the amount of customer
complaints should not exceed 10% of customers"). In this regard, a paper by
Maggi et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] features a framework to predict whether or not an ongoing case
will ful ll a given compliance rule upon its completion based on: (i) the sequence
of activities executed in a given case; and (ii) the values of data attributes after
each execution of an activity in a case. This framework has been extended in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
to take into consideration data attributes of all currently executed events in an
ongoing case. In addition, predictive models are pre-trained o ine, thus enabling
a drastic reduction of runtime overhead.
      </p>
      <p>
        Most of the above-mentioned approaches focus on intra-case predictive
monitoring, meaning that running cases are viewed independently from each other.
However, in real-life scenarios, one needs to take into account dependencies
between cases, particularly due to resource contention and data sharing.
Additionally, the distribution of types of cases (e.g., high number of \di cult" open
cases) a ects the percentage of cases that end up in a negative outcome [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
Techniques that take into inter-case dependencies are known as inter-case
predictive monitoring.
2.3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Predictions of Path Completion</title>
      <p>
        A range of research proposals has tackled the problem of predicting the
continuation of running process instances or characteristics thereof. For example,
Lakshmanan et al. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] develop a technique to estimate the probability of
execution of any potential future task in an ongoing process instance using extended
Markov chain. Subramaniam et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] take a step further by predicting possible
paths of a running instance up to its completion. For that, they generate
classication rules using decision trees algorithm C4.5. Pravilovic et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] propose
a framework for prediction of future events or their properties. Their approach
transforms event-forecasting tasks into sliding windows of time intervals, which
are then processed in a predictive clustering tree (PCT).
      </p>
      <p>
        De Leoni et al. [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] propose a framework for prediction of various process
characteristics based on correlations with other characteristics (independent
variables). Speci cally, they map each event of an event log to a decision table with
several associated attributes to learn associations from. The approach has been
extended in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] to include clustering of event log traces. However, the proposed
solution requires process characteristics to be discretized and this discretization
may have large repercussions in the results.
      </p>
      <sec id="sec-3-1">
        <title>Research Problem</title>
        <p>As demonstrated before, a number of techniques have been proposed to address
very speci c prediction goals, e.g. prediction of deadline violations or are
applicable for speci c datasets. The working hypothesis of the project is that most
prediction goals can be viewed as speci c instances of a more generic problem,
that is prediction of a completion path of a given case (starting from a current
point in time) and characteristics of that path. For example, to predict the
occurrence of defect waste induced when a defective execution of an activity leads
to a rework (i.e. a part of the process having to be repeated in order to
correct the defect), one can query the obtained likely sequence completions for the
presence of rework loops.</p>
        <p>Consequently, in this project we aim to develop a general predictive
monitoring framework that can be instantiated for a wide range of prediction goals and
for di erent domains, e.g. transportation, insurance and healthcare domains. In
other words, the goal of the project is to move the state of the art of
predictive monitoring from ad-hoc solutions with a narrow focus to a general solution
framework.</p>
        <p>The proposed framework will take as input: (i) an event log of historical,
i.e. completed process execution traces; (ii) a sequence of activities executed in a
given process case along with its data attributes and (iii) a set of prediction goals
(Figure 2). The output will be determined by the prediction goal. For example,
if the goal is the prediction of the remaining processing time, the output will be
the most likely value of the remaining time along with its con dence interval. If
the goal is to predict the discrete outcome of a case, the framework will output
the probabilistic distribution of the possible outcomes.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Research Questions</title>
      <p>The research project will address the following research questions:
{ RQ1. How can predictive monitoring methods be used to predict the most
likely outcome of the process? The outcome can be binary (e.g. whether the
case ended up normally) or a numerical function (e.g. the cycle time of the
case).
{ RQ2. How can predictive monitoring methods be used to predict the
outcome of a speci c activity? Similarly to the previous problem, the outcome
of an activity can be boolean (e.g. whether a check has been passed) or
numerical (e.g. the cycle time of the activity).
{ RQ3. How can predictive monitoring methods be used to predict the entire
sequence of activities leading to the process end and characteristics of the
sequence? In other words, for an ongoing process case, we aim to determine
the most likely trace su x.</p>
    </sec>
    <sec id="sec-5">
      <title>Research Criteria</title>
      <p>The framework designed as a result of this research will be evaluated using the
several criteria. First, the solution should be able to make predictions about a
given outcome with relatively high levels of accuracy. Next, it should be possible
to make predictions as early as possible, as soon as there is enough information
in an uncompleted trace to make a prediction with su cient con dence. Finally,
the predictions should incur a minimum runtime overhead to be made almost
instantaneously, with limited computing resources, over real-scale scenarios.</p>
    </sec>
    <sec id="sec-6">
      <title>Limitations of the Study</title>
      <p>Predictive process monitoring is usually used for the early classi cation of process
instances into normal and deviant based on some performance metrics. However,
explaining the reasons for a process case deviation from its expected execution
lays foundation for deviance mining techniques, which are largely out of scope
of the current PhD project.</p>
      <p>Another limitation stems from the fact that prediction accuracy depends on
the variability of the process. Speci cally, processes that signi cantly variate
between cases are usually highly unpredictable. Hence, a reasonable prediction
accuracy can be only achieved at the expense of earliness, i.e. only when the case
is about to nish.</p>
      <p>In addition, we will largely focus on intra-case predictive monitoring,
meaning that we see a running case in isolation from the others, thus discarding
inter-case relations, such as those due to resource and data contention.
4</p>
      <sec id="sec-6-1">
        <title>Research Methodology</title>
        <p>The research approach of this project is inspired by the design science
methodology. In line with the design science methodology (Figure 3), we started from
a preliminary literature review of the predictive process monitoring approaches.
This study allowed us to identify a gap in the current state of the art and
formulate a research proposal to address the gap.</p>
        <p>RQ1
RQ2
RQ3
1. Define a problem
• Literature review
• Problem formulation
• Literature review
2. Suggest a solution • Pilot design</p>
        <p>• Baselines &amp; hypotheses
3. Develop artifacts
4. Evaluate artifacts
5. Conclude
• Develop algorithms
• Implement software
• Conduct experiments to</p>
        <p>validate the artifacts
• Publish the results and</p>
        <p>findings</p>
        <p>The next stage involved further studies of related work with a particular
focus on machine learning and process mining algorithms behind them. This
stage resulted in construction of baseline predictive models and formulation of
hypotheses to be checked at the later stages.</p>
        <p>At the third stage of the project, we produce viable artifacts in the form of
software that implements the models for predicting various properties of running
business processes, e.g. whether the process case will meet a certain performance
objective and whether the case will contain a re-work loop. Aside from
predictions, the models will potentially be able to explain the causes of various case
properties.</p>
        <p>A research contribution requires a rigorous evaluation of the artifacts. Thus,
during the fourth stage, we plan to validate the proposed techniques with respect
to the previously de ned research criteria, using datasets exhibiting di erent
characteristics. Speci cally, a trade-o between earliness and accuracy for various
prediction goals and domains needs to be assessed. To test the applicability of
the framework at runtime, we also have to measure how fast the predictions
can be calculated. Additionally, we plan to compare predictive methods with
reactive ones.</p>
        <p>Finally, at the last stage of the project, we will wrap up the results of our
studies in the form of a doctoral thesis (by monograph).</p>
        <p>Stages 2, 3 and 4 constitute the core part of this research and will be
implemented according to an iterative and incremental development model, meaning
that they will be sequentially revisited for each research question. In addition,
we plan to address research questions RQ1 and RQ2 in two major iterations.
Initially, we develop a simpler technique to predict the case completion path,
while during the next iteration we re ne the previously obtained results by
lifting the assumptions made in the rst iteration. Thus, these stages will be partly
overlapping.
5</p>
      </sec>
      <sec id="sec-6-2">
        <title>Preliminary Results</title>
        <p>In this section, we describe our present academic contribution, in line with the
formulated research questions (see Section 3).</p>
        <p>
          First, to address RQ1, we have developed a framework to predict the most
likely outcome of an ongoing case, given its pre x and a set of traces of
historical (completed) cases. Speci cally, we extended the approach presented
in [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] through the use of a multiple classi er method and the combination
of a clustered-based approach with the approach based on complex symbolic
sequences introduced in [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. The evaluation conducted on real-life datasets
from two application domains (hospital healthcare and insurance) showed that
the multiple-classi ers k-medoids variant outperforms others (including a pure
classi cation-based approach) in the context of early prediction while having low
run-time overhead, which allows for making online predictions. The outcome of
the stage had been formalized in a paper titled \Complex symbolic sequence
clustering and multiple classi ers for predictive process monitoring". The paper
has been presented at the BPI'15 Workshop and published in its proceedings
[
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
        </p>
        <p>
          Next, the research question RQ2 has been tackled in the context of process
optimization by minimizing overprocessing, i.e. the e ort that is spent in the
performance of activities to an extent that does not add value to the customer nor
to the business. Speci cally, we have developed a framework to predict, at
runtime, processing times and rejection probabilities of the checks to be performed
during the execution of a case. Hence, the checks can be resequenced at runtime
based on the characteristics of the current case in such an order that incurs the
lowest overprocessing. The evaluation of the proposed framework showed that
for processes with the reject probabilities being close to each other, it
outperforms a traditional design-time ordering approach, wherein checks are performed
in a xed order across all cases. The outcome of the stage has been formalized in
a paper titled \Minimizing overprocessing waste in business processes via
predictive activity ordering". The paper has been accepted for publication at the
CAiSE 2016 [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ].
        </p>
        <p>Finally, to address RQ3, we plan to develop a framework for predicting
sequence completion for an ongoing process case. Speci cally, for a given point
during the process case execution, we extract all possible scenarios of how this
case may unfold up to its completion and estimate probabilities of each scenario.
This stage of the project is currently in the implementation phase. We utilize a
two-module framework wherein the rst module, for a current ongoing execution
trace, nds equivalent or similar pre xes in the historical log of completed traces;
while the second module analyzes su xes corresponding to previously discovered
pre xes and learns a structured prediction model using techniques like recurrent
neural networks or hidden Markov models. First experiments have shown that,
for most logs, predictions are accurate and robust only with short su xes, i.e.
only for the next few events.
6</p>
      </sec>
      <sec id="sec-6-3">
        <title>Conclusion and Future Work</title>
        <p>In this paper, we detailed and motivated our PhD project. A research gap in
state of the art predictive business process monitoring has been identi ed and the
outline of the research plan for investigating a solution for the identi ed gap is
proposed. In future work, the so far developed artifacts, along with the technique
for the prediction of case completion path currently being developed { will be
incorporated into a general framework for predictive process monitoring that
would be able to address speci c process monitoring tasks. The framework will
be implemented using a combination of state-of-the-art machine learning and
process mining algorithms, and evaluated using real-life datasets with di erent
characteristics.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. von Rosing, M.,
          <string-name>
            <surname>von Scheel</surname>
          </string-name>
          , H.,
          <string-name>
            <surname>Scheer</surname>
            ,
            <given-names>A.W.:</given-names>
          </string-name>
          <article-title>The Complete Business Process Handbook: Body of Knowledge from Process Modeling to BPM</article-title>
          .
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Metzger</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leitner</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ivanovic</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmieders</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Franklin</surname>
            , R.: Comparing and
            <given-names>Combining</given-names>
          </string-name>
          <string-name>
            <surname>Predictive Business Process Monitoring Techniques</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Pika</surname>
          </string-name>
          , A.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fidge</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          , ter
          <string-name>
            <surname>Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wynn</surname>
          </string-name>
          , M.T.:
          <article-title>Predicting deadline transgressions using event logs</article-title>
          .
          <source>In: BPM Workshops</source>
          , Springer (
          <year>2013</year>
          )
          <volume>211</volume>
          {
          <fpage>216</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Suriadi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ouyang</surname>
          </string-name>
          , C.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.:</given-names>
          </string-name>
          <article-title>Root cause analysis with enriched process logs</article-title>
          .
          <source>In: BPM Workshops</source>
          , Springer (
          <year>2013</year>
          )
          <volume>174</volume>
          {
          <fpage>186</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Feldman</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fournier</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Franklin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Metzger</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Proactive event processing in action: a case study on the proactive management of transport processes</article-title>
          .
          <source>In: Proceedings of the ACM DEBS'13 Conference</source>
          , ACM (
          <year>2013</year>
          )
          <volume>97</volume>
          {
          <fpage>106</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Metzger</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Franklin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Engel</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Predictive monitoring of heterogeneous service-oriented business networks: The transport and logistics case</article-title>
          .
          <source>In: SRII Global Conference (SRII)</source>
          ,
          <year>2012</year>
          Annual, IEEE (
          <year>2012</year>
          )
          <volume>313</volume>
          {
          <fpage>322</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schonenberg</surname>
            ,
            <given-names>M.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schonenberg</surname>
            ,
            <given-names>M.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Time prediction based on process mining</article-title>
          .
          <source>Information Systems</source>
          <volume>36</volume>
          (
          <issue>2</issue>
          ) (
          <year>2011</year>
          )
          <volume>450</volume>
          {
          <fpage>475</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Polato</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sperduti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burattin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Leoni</surname>
          </string-name>
          , M.:
          <article-title>Time and activity sequence prediction of business process instances</article-title>
          .
          <source>arXiv preprint arXiv:1602.07566</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rogge-Solti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Prediction of business process durations using nonMarkovian stochastic Petri nets</article-title>
          .
          <source>Information Systems</source>
          <volume>54</volume>
          (
          <year>2015</year>
          )
          <volume>1</volume>
          {
          <fpage>14</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Folino</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guarascio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pontieri</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Discovering context-aware models for predicting business process performances</article-title>
          .
          <source>In: On the Move to Meaningful Internet Systems: OTM 2012. Volume 7565 LNCS</source>
          . Springer (
          <year>2012</year>
          )
          <volume>287</volume>
          {
          <fpage>304</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Senderovich</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mandelbaum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Queue mining{predicting delays in service processes</article-title>
          .
          <source>In: Advanced Information Systems Engineering</source>
          , Springer (
          <year>2014</year>
          )
          <volume>42</volume>
          {
          <fpage>57</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>S.H.</given-names>
          </string-name>
          :
          <article-title>Real-time business process monitoring method for prediction of abnormal termination using KNNI-based LOF prediction</article-title>
          .
          <source>Expert Systems with Applications</source>
          <volume>39</volume>
          (
          <issue>5</issue>
          ) (
          <year>2012</year>
          )
          <volume>6061</volume>
          {
          <fpage>6068</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Conforti</surname>
            , R., de Leoni,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>La</given-names>
            <surname>Rosa</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.:</given-names>
          </string-name>
          <article-title>A recommendation system for predicting risks across multiple business process instances</article-title>
          .
          <source>Decision Support Systems</source>
          <volume>69</volume>
          (
          <year>2015</year>
          )
          <volume>1</volume>
          {
          <fpage>19</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Predictive monitoring of business processes</article-title>
          .
          <source>In: Advanced Information Systems Engineering</source>
          . Volume
          <volume>8484</volume>
          LNCS., Springer (
          <year>2014</year>
          )
          <volume>457</volume>
          {
          <fpage>472</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Leontjeva</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Conforti</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.M.</surname>
          </string-name>
          :
          <article-title>Complex Symbolic Sequence Encodings for Predictive Monitoring of Business Processes</article-title>
          . In: Business Process Management. Springer (
          <year>2015</year>
          )
          <volume>297</volume>
          {
          <fpage>313</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Lakshmanan</surname>
            ,
            <given-names>G.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shamsi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Doganata</surname>
            ,
            <given-names>Y.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Unuvar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khalaf</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A markov prediction model for data-driven semi-structured business processes</article-title>
          .
          <source>Knowledge and Information Systems</source>
          <volume>42</volume>
          (
          <issue>1</issue>
          ) (
          <year>2013</year>
          )
          <volume>97</volume>
          {
          <fpage>126</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Subramaniam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalogeraki</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gunopulos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Business Processes:
          <article-title>Behavior Prediction and Capturing Reasons for Evolution</article-title>
          .
          <source>In: ICEIS (3)</source>
          , Citeseer (
          <year>2006</year>
          )
          <volume>3</volume>
          {
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Pravilovic</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Appice</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malerba</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Process Mining to Forecast the Future of Running Cases</article-title>
          . In: New Frontiers in Mining Complex Patterns. Springer (
          <year>2013</year>
          )
          <volume>67</volume>
          {
          <fpage>81</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. de Leoni, M.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dees</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A general framework for correlating business process characteristics</article-title>
          .
          <source>In: Business Process Management</source>
          . Springer (
          <year>2014</year>
          )
          <volume>250</volume>
          {
          <fpage>266</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. de Leoni, M.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dees</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A general process mining framework for correlating, predicting and clustering dynamic behavior based on event logs</article-title>
          .
          <source>Information Systems</source>
          <volume>56</volume>
          (
          <year>2016</year>
          )
          <volume>235</volume>
          {
          <fpage>257</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Francescomarino</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teinemaa</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sommarive</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Clustering-Based Predictive Process Monitoring</article-title>
          .
          <source>CoRR abs/1506.0(i)</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Verenich</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosa</surname>
            ,
            <given-names>M.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Francescomarino</surname>
          </string-name>
          , C.D.:
          <article-title>Complex Symbolic Sequence Clustering and Multiple Classi ers for Predictive Process Monitoring</article-title>
          .
          <source>In: BPI'15 Workshop</source>
          . (
          <year>2015</year>
          )
          <volume>1</volume>
          {
          <fpage>12</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Verenich</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosa</surname>
            ,
            <given-names>M.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Francescomarino</surname>
          </string-name>
          , C.D.:
          <article-title>Minimizing Overprocessing Waste in Business Processes via Predictive Activity Ordering</article-title>
          .
          <source>In: Advanced Information Systems Engineering</source>
          , Springer (
          <year>2016</year>
          ) To appear.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>