<!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>
      <journal-title-group>
        <journal-title>D. Knuplesch, M. Reichert, A. Kumar, A framework for visually monitoring business process
compliance, Inf. Syst.</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1016/j.is.2016.10.006</article-id>
      <title-group>
        <article-title>A Mashup-Based Approach for Predictive Compliance Monitoring⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Adrián Romero-Flores</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alfonso E. Márquez-Chamorro</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>Cristina Cabanillas</string-name>
          <email>cristinacabanillas@us.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>I3US Institute, Universidad de Sevilla</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Smart Computer Systems Research and Engineering Lab (SCORE), Universidad de Sevilla</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2008</year>
      </pub-date>
      <volume>64</volume>
      <issue>2017</issue>
      <fpage>504</fpage>
      <lpage>516</lpage>
      <abstract>
        <p>Predictive Compliance Monitoring (PCM) is an emerging field that integrates predictive techniques with compliance monitoring to ensure business processes adhere to regulatory and organizational standards. Existing research in this area has been limited, as current approaches mainly focus on monitoring Service Level Agreements (SLAs) or restrict predictions to remaining execution time. This paper introduces a framework for PCM that utilizes multiple predictive process monitoring (PPM) models on compliance mashups. The framework forecasts key process indicators, including next event predictions, remaining execution time, and process outcomes, while simultaneously evaluating compliance with predefined rules. This approach advances automated compliance monitoring and highlights key challenges and future research opportunities in the PCM field.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;predictive compliance monitoring</kwd>
        <kwd>predictive process monitoring</kwd>
        <kwd>compliance monitoring</kwd>
        <kwd>business process management</kwd>
        <kwd>compliance mashups</kwd>
        <kwd>compliance checking</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Ensuring compliance of business processes with internal policies and external regulations – such as
GDPR for data protection, HIPAA for healthcare data privacy, or ISO 27001 for information security
management – is a critical challenge for organizations. Compliance violations can lead to legal penalties,
ifnancial losses and operational ineficiencies. Traditional compliance monitoring techniques typically
focus on detecting non-compliant behavior either retrospectively (post-mortem) or during process
design and execution (pre-mortem) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>However, these reactive approaches are often insuficient in mitigating compliance risks before
violations occur. A key challenge in compliance monitoring is integrating predictive capabilities that
anticipate potential violations in advance. Developing an approach that can generalize across diferent
compliance requirements and provide early detection while ensuring accuracy, interpretability, and
scalability remains an open research problem.</p>
      <p>
        Predictive Process Monitoring (PPM) ofers a promising approach to addressing this challenge. PPM
leverages historical data from process executions stored in event logs to forecast the future behavior of
running process instances [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. These predictions can take diferent forms, such as estimating remaining
execution time, forecasting outcomes, or anticipating the next process event. These predictions act as
key performance indicators for ongoing processes, ofering valuable insights to businesses.
      </p>
      <p>
        In this idea paper, we introduce a conceptual framework for Predictive Compliance Monitoring
(PCM) that leverages compliance mashups [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to generate partial PPM predictions. Our approach
tackles key challenges in the PCM field, including the generalization of compliance requirements
beyond SLA-specific constraints and the integration of multiple predictive models to handle more
complex compliance rules. Furthermore, we identify key research challenges in the PCM field, ofering
a foundation for future research.
      </p>
      <p>The remaining of the paper is structured as follows. Section 2 outlines related work and the limitations
of existing approaches that motivate this work. Section 3 presents our proposed framework for PCM
based on compliance mashups. Finally, Section 4 reflects on the approach, its scope and limitations, the
challenges ahead and plans for future work in this research area.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Motivation</title>
      <p>
        Predictive compliance monitoring is a largely unexplored research area that focuses on forecasting
potential violations of compliance constraints in business processes. A recent survey on PCM [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
highlights the limited research in this domain and identifies key studies contributing to the field. As
discussed in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], two primary approaches to PCM exist: (i) Predicate Prediction, which predicts whether
a constraint is fulfilled, and (ii) PCM based on PPM, which builds a compliance monitoring system on
top of PPM results. For example, Predicate Prediction might be used to determine whether an invoice
approval will meet a regulatory deadline before the process is completed. In contrast, a PCM approach
on PPM would first predict the expected remaining time of an approval process and then assess whether
this prediction aligns with compliance constraints. The key distinction lies in Predicate Prediction
providing a direct compliance verdict, whereas PCM based on PPM relies on intermediate process
forecasts to infer compliance status.
      </p>
      <p>
        Rinderle-Ma et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] identified seven key studies that can be classified as PCM. Leitner et al. [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]
predict Service Level Agreements (SLA) violations using remaining time prediction, qualifying as a
PPM approach. In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], they also introduce preventive methods to ensure that predictions adhere to
the defined Service Level Objectives (SLOs). Khan et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] provide a generic model for compliance
prediction in business processes, utilizing trace activity and time data for binary classification. Cicotti
et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] propose a Quality of Service (QoS) predictor for SLA compliance monitoring based on a
probabilistic model. Rodríguez et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] employ decision trees to explain compliance root causes and use
them to predict whether a process is compliant. Comuzzi et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] present a metric for SLA predictive
monitoring by forecasting boolean SLOs. Ivanović et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] focus on predicting QoS at runtime to
support service orchestration.
      </p>
      <p>
        These approaches sufer from several limitations that prevent them from functioning as a
comprehensive PCM system. Specifically, existing methods typically fall into one of three categories: (i) they
focus solely on remaining time prediction in PPM, (ii) they are restricted to SLA compliance, or (iii)
they operate only at the level of individual process instances [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. As a result, these approaches rely on
relatively simple compliance rules, lacking the ability to handle more complex compliance constraints
that involve multiple features or events.
      </p>
      <p>This gap underscores the need for further research to develop PCM solutions that move beyond
SLA-specific compliance monitoring, incorporate advanced predictive capabilities, and support the
enforcement of complex compliance rules spanning multiple process features or events.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Our Proposal</title>
      <p>
        We propose a conceptual framework for PCM that leverages compliance mashups [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] for defining and
automatically monitoring compliance rules. Our approach generates PPM models on these mashups,
enabling partial predictions of the rules and ultimate unifying the obtained results to verify compliance.
      </p>
      <p>
        A mashup is a data-driven workflow (a.k.a. data flow ) built with information from one or more
data sources that might be transformed and propagated to produce a desired output in a reusable User
Interface (UI) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Compliance mashups [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] refer to mashups specifically designed for compliance
checking purposes. These mashups facilitate the automated verification of compliance rules at design
      </p>
      <p>PCM Framework
Offline Stage</p>
      <p>Online Stage</p>
      <p>Event Log
Compliance
Mashups</p>
      <p>Preprocessing
Generate PPM
models based on</p>
      <p>Mashups</p>
      <p>Rule 1 Model
Rule 2... Model</p>
      <p>Rule N Model</p>
      <p>Train and
evaluate models</p>
      <p>Get process
predictions</p>
      <p>Check
compliance</p>
      <p>Dashboard
Evaluation
Metrics</p>
      <p>
        Ongoing trace
time or run time by integrating heterogeneous data sources, applying necessary transformations, and
producing compliance evaluation results in an interpretable format. Each mashup operationalizes
one compliance rule, although mashups can be embedded into domain-specific components to adapt
to diferent granularities and enhance scalability. Tools like STATUS [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] leverage the mashup-based
compliance management framework presented in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to build a low-code compliance monitoring system.
      </p>
      <p>
        Figure 1 depicts the architecture of our proposed framework for PCM. We assume that all compliance
rules can be verified based on data from event logs. This assumption is generally adopted by existing
compliance monitoring approaches [
        <xref ref-type="bibr" rid="ref14">14, 15</xref>
        ]. Our framework integrates PPM, a well established discipline
that applies machine learning techniques to forecast process behavior or outcomes. Specifically, we
consider predictive models generated by machine learning techniques such as neural networks or
decision trees, which estimates the next process event(s), next event time, remaining execution time,
process outcome, or any combination of these [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>The framework comprises two stages. For a compliance rule, the ofline stage generates PPM models
based on historical event logs containing information about the respective process executions, and
on the compliance mashup that monitors the rule. First, the system parses the mashup to identify
the components of the compliance rule. Subsets of the mashup components can be used to infer
intermediate PPM models. These intermediate models serve as building blocks for the final compliance
prediction. After constructing the individual models, the system preprocesses the event log, trains
each rule-specific model, and evaluates its performance using well-established evaluation metrics. We
consider classification metrics such as accuracy, precision, recall, and F1-score for categorical predictions
(e.g., predicting the next activity). For numerical predictions, such as remaining execution time, we use
regression metrics like Mean Absolute Error (MAE) and Root Mean Square Error (RMSE).</p>
      <p>In the online stage, the trained models generate compliance predictions for ongoing process instances.
The system processes the latest instance data through the corresponding predictive models, producing
probabilistic forecasts of upcoming events, execution times, and process outcomes. These predictions
are then integrated into compliance mashups, enabling real-time assessment of whether the process is
likely to remain compliant or violate predefined rules.</p>
      <p>We exemplify the use of the framework with a simple scenario. Consider an industrial production
plant where maintaining product quality and preventing overheating are critical. The plant follows
a structured cooling and quality assurance process to ensure that materials are processed within
Running
process
instances (bp)
predefined temperature and time regulations. Each batch of materials undergoes a series of steps,
starting with (A) material preparation, followed by (B) heat treatment, (C) cooling, (D) quality inspection,
and finally ( E) packaging. Throughout the process, compliance with two key rules must be ensured.
First (c1), once a batch enters the heat treatment phase, packaging must be completed within 60 minutes
to prevent material degradation. Second (c2), the material’s temperature must remain below 90°C to
avoid safety hazards.</p>
      <p>The process event log entries include a unique identifier for each process instance that enable the
recognition of process traces, labeled caseID; the specific process activity to which the event refers,
named activity; the date and time when the activity occurred, marked as timestamp; and a numerical
value for temperature measurements, identified as temperature.</p>
      <p>The compliance mashups for rules c1 and c2 are depicted in Figure 2. These mashups consist of nodes
that retrieve and transform information from process traces, enabling the generation and training of
the necessary PPM models based on historical data.</p>
      <p>The predictive models required for our example are as follows. For rule c1, the system includes two
predictors. The Next activity predictor forecasts the subsequent process activities on the follows(B,E)
node in mashup c1, which detects if the activity B is followed eventually by the activity E. The Next
event time predictor estimates the time diference between events, utilizing the lastTimestamp(B),
lastTimestamp(E), and timeDiff() nodes. For Rule c2, the Outcome predictor is used, which infers
the process outcome from the getTemperatures() node in mashup c2.</p>
      <p>When a process instance is actively running, the system employs the previously trained models to
generate compliance predictions in real time. Based on the models associated with each compliance
mashup, the system evaluates the likelihood of future compliance or violation. Figure 3 illustrates an
example of the online stage as seen in Figure 1, where a running trace undergoes predictive compliance
assessment. Rule c1 Model forecasts the next activity and expected event timestamp for the monitoring
Rule c1 Model: E must happen eventually after B within 1 hour.</p>
      <p>MODEL
nextActivity()</p>
      <p>E with 90% confidence</p>
      <p>MODEL
nextEventTimestamp()
2025-02-25T12:50
with 85% confidence</p>
      <p>Ongoing trace
[2, B, 84, 2025-02-25T12:30]</p>
      <p>Rule c2 Model : The temperature must never exceed 90ºC</p>
      <p>MODEL
nextTemperature() 93 with 75% confidence</p>
      <p>Predictions
into the mashup
of c1; and Rule c2 Model forecasts the temperature for the monitoring of c2.</p>
      <p>These results are then integrated into the compliance mashup to determine the compliance degree
for each rule. The compliance degree is a quantitative measure of how closely the predicted process
execution aligns with the compliance rules. The compliance degree can be expressed as a binary
classification (compliant / non-compliant) with a probability score reflecting the likelihood of the
prediction. For example, in Figure 3 the compliance degree for rule c1 is classified as compliant with a
probability of 76.5%. This combined probability for c1 is derived from the confidences of the constituent
predictions; in this instance, it corresponds to the product of the 90% confidence for the predicted next
activity (E) and the 85% confidence for the predicted timestamp ( 0.90 · 0.85 = 0.765). For rule c2, it is
categorized as non-compliant with a probability of 75%.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>
        This idea paper proposes a novel approach to PCM using compliance mashups. By integrating predictive
models with compliance mashups, this approach enhances the coverage of the Compliance Monitoring
Functionalities (CMFs) related to PCM outlined in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Specifically, it supports previously uncovered
functionalities such as non-atomic activities (CMF4), life cycle considerations (CMF5), multiple instance
constraints (CMF6), root cause analysis (CMF9) and compliance degree calculation (CMF10).
      </p>
      <p>The main limitations of this approach are, first, the lack of integration with information systems
that do not rely on event logs, which restricts the range of applicable data sources. Second, the types
of predictions supported are inherently constrained by the capabilities of PPM, limiting the scope of
compliance violations that can be anticipated.</p>
      <p>This work also unveils several challenges that remain open. One of the key issues is implementing
eficient online (re-)training mechanisms for each predictive model to adapt to evolving processes
dynamically. The second challenge lies in determining the compliance degree, as common regression
models do not inherently provide a confidence measure. Some methods, such as those proposed in
[16, 17], ofer estimation techniques for this measure. The third open challenge is defining the number
of future events to predict. This introduces the need for sophisticated predictive models, such as Long
Short-Term Memory (LSTM) networks, which can generate sequences of predictions rather than isolated
forecasts. Lastly, the challenge of inferring the appropriate predictive models from the mashups emerges.
This involves determining which mashup components are necessary for compliance predictions and
how to eficiently combine them.</p>
      <p>Future research should focus on addressing these limitations and challenges, and developing scalable
architectures for real-world applications. By tacking these issues, compliance monitoring systems can
transition from reactive approaches to fully proactive PCM systems, enabling early compliance insights,
reducing operational risks, and ensuring greater regulatory adherence.</p>
    </sec>
    <sec id="sec-5">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used ChatGPT in order to: Grammar and spelling
check, Paraphrase and reword. After using this tool/service, the author(s) reviewed and edited the
content as needed and take(s) full responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L. T.</given-names>
            <surname>Ly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Montali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rinderle-Ma</surname>
          </string-name>
          , W. M. van der Aalst,
          <article-title>Compliance monitoring in business processes: Functionalities, application</article-title>
          , and tool-support,
          <source>Information Systems</source>
          <volume>54</volume>
          (
          <year>2015</year>
          )
          <fpage>209</fpage>
          -
          <lpage>234</lpage>
          . doi:https://doi.org/10.1016/j.is.
          <year>2015</year>
          .
          <volume>02</volume>
          .007.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Márquez-Chamorro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Resinas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruiz-Cortés</surname>
          </string-name>
          ,
          <article-title>Predictive monitoring of business processes: A survey</article-title>
          ,
          <source>IEEE Transactions on Services Computing</source>
          <volume>11</volume>
          (
          <year>2018</year>
          )
          <fpage>962</fpage>
          -
          <lpage>977</lpage>
          . doi:
          <volume>10</volume>
          .1109/TSC.
          <year>2017</year>
          .
          <volume>2772256</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Cabanillas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Resinas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruiz-Cortés</surname>
          </string-name>
          ,
          <article-title>A Mashup-Based Framework for Business Process Compliance Checking</article-title>
          ,
          <source>IEEE Transactions on Services Computing</source>
          <volume>15</volume>
          (
          <year>2022</year>
          )
          <fpage>1564</fpage>
          -
          <lpage>1577</lpage>
          . doi:
          <volume>10</volume>
          . 1109/TSC.
          <year>2020</year>
          .
          <volume>3001292</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Rinderle-Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-V.</given-names>
            <surname>Benzin</surname>
          </string-name>
          ,
          <article-title>Predictive compliance monitoring in process-aware information systems: State of the art</article-title>
          , functionalities, research directions,
          <source>Information Systems</source>
          <volume>115</volume>
          (
          <year>2023</year>
          )
          <article-title>102210</article-title>
          . URL: https://www.sciencedirect.com/science/article/pii/S0306437923000467. doi:https://doi.org/10.1016/j.is.
          <year>2023</year>
          .
          <volume>102210</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Leitner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ferner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hummer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dustdar</surname>
          </string-name>
          ,
          <article-title>Data-driven and automated prediction of service level agreement violations in service compositions</article-title>
          ,
          <source>Distributed and Parallel Databases</source>
          <volume>31</volume>
          (
          <year>2013</year>
          )
          <fpage>447</fpage>
          -
          <lpage>470</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10619-013-7125-7.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>Leitner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Michlmayr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rosenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dustdar</surname>
          </string-name>
          ,
          <string-name>
            <surname>Monitoring</surname>
          </string-name>
          , Prediction and Prevention of SLA Violations in Composite Services,
          <source>in: IEEE International Conference on Web Services (ICWS)</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>369</fpage>
          -
          <lpage>376</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICWS.
          <year>2010</year>
          .
          <volume>21</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McClean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Charles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Taylor</surname>
          </string-name>
          , D. Nauck,
          <article-title>A Generic Model for End State Prediction of Business Processes Towards Target Compliance</article-title>
          ,
          <year>2019</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>335</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>030</fpage>
          -34885-4_
          <fpage>25</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Cicotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Coppolino</surname>
          </string-name>
          , S. D'Antonio, L. Romano,
          <article-title>Runtime Model Checking for SLA Compliance Monitoring</article-title>
          and
          <string-name>
            <given-names>QoS</given-names>
            <surname>Prediction</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wirel</surname>
          </string-name>
          . Mob.
          <source>Networks Ubiquitous Comput. Dependable Appl</source>
          .
          <volume>6</volume>
          (
          <issue>2015</issue>
          )
          <fpage>4</fpage>
          -
          <lpage>20</lpage>
          . doi:http://dx.doi.org/10.22667/JOWUA.
          <year>2015</year>
          .
          <volume>06</volume>
          .31.004.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rodríguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Silveira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Daniel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Casati</surname>
          </string-name>
          ,
          <article-title>Analyzing Compliance of Service-Based Business Processes for Root-Cause Analysis</article-title>
          and Prediction,
          <year>2010</year>
          , pp.
          <fpage>277</fpage>
          -
          <lpage>288</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>642</fpage>
          -16985-4_
          <fpage>25</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Comuzzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Marquez-Chamorro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Resinas</surname>
          </string-name>
          ,
          <article-title>A hybrid reliability metric for sla predictive monitoring</article-title>
          ,
          <source>in: ACM/SIGAPP Symposium on Applied Computing</source>
          ,
          <year>2019</year>
          , p.
          <fpage>32</fpage>
          -
          <lpage>39</lpage>
          . URL: https: //doi.org/10.1145/3297280.3297285. doi:
          <volume>10</volume>
          .1145/3297280.3297285.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ivanović</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Carro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hermenegildo</surname>
          </string-name>
          ,
          <article-title>Constraint-Based runtime prediction of SLA violations in service orchestrations</article-title>
          ,
          <source>in: International Conference on Service-Oriented Computing (ICSOC)</source>
          ,
          <year>2011</year>
          , p.
          <fpage>62</fpage>
          -
          <lpage>76</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -25535-
          <issue>9</issue>
          _
          <fpage>5</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F.</given-names>
            <surname>Daniel</surname>
          </string-name>
          , M. Matera, Mashups: Concepts,
          <source>Models and Architectures</source>
          , Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Á. Bernal</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Montero</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Cabanillas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Fernandez</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Resinas</surname>
            , ST
            <given-names>A</given-names>
            TUS: A
          </string-name>
          <string-name>
            <surname>Low-Code Business Process Compliance Management System</surname>
          </string-name>
          ,
          <source>in: BPM Demos</source>
          , volume
          <volume>3758</volume>
          ,
          <year>2024</year>
          , pp.
          <fpage>141</fpage>
          -
          <lpage>145</lpage>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3758</volume>
          /paper-26.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Awad</surname>
          </string-name>
          , E. Pascalau,
          <string-name>
            <given-names>M.</given-names>
            <surname>Weske</surname>
          </string-name>
          ,
          <article-title>Towards Instant Monitoring of Business Process Compliance</article-title>
          ,
          <source>EMISA Forum 30</source>
          (
          <year>2010</year>
          )
          <fpage>10</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>