<!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>Rule Mining in Action: The RuM Toolkit</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anti Alman Claudio Di Ciccio</string-name>
          <email>anti.alman@ut.ee</email>
          <email>anti.alman@ut.ee diciccio@di.uniroma1.it</email>
          <email>diciccio@di.uniroma1.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dominik Haas</string-name>
          <email>dominik.haas@s.wu.ac.at</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabrizio Maria Maggi</string-name>
          <email>maggi@inf.unibz.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jan Mendling</string-name>
          <email>jan.mendling@wu.ac.at</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Free University of Bolzano</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Tartu Sapienza University of Rome</institution>
          ,
          <country>Estonia Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>WU Vienna</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>-Procedural process modeling languages can be difficult to use for process mining in cases where the process recorded in the event log is unpredictable and has a high number of different branches and exceptions. In these cases, declarative process modeling languages such as DECLARE are more suitable. Declarative languages do not aim at modeling the end-to-end process step by step, but constrain the behavior of the process using rules thus allowing for more variability in the process model yet keeping it compact. Although there are several commercial and academic process mining tools available based on procedural models, there are currently no comparable tools for working with declarative models. In this paper, we present RuM, an accessible and easy-to-use rule mining toolkit integrating multiple DECLARE-based process mining methods into a single unified application. RuM implements process mining techniques based on Multi-Perspective DECLARE, namely the extension of DECLARE supporting data constraints together with controlflow constraints. In particular, RuM includes support for process discovery, conformance checking, log generation and monitoring as well as a model editor. The application has been evaluated by conducting a qualitative user evaluation with eight process analysts. Index Terms-Rule Mining, Process Analytics Tool, Declarative Process Models, Process Mining</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>Process mining is the area of Business Process Management
(BPM) which is focused on the analysis of business processes
based on event logs containing information about process
executions. A key artifact used in process mining is a process
model. The most common type of process models used for
process mining are procedural models, which aim at describing
end-to-end processes and allow only for activities that are
explicitly triggered through the control-flow. However, modeling
the entire control-flow step by step can be inconvenient in
some cases. For example, if the process is unpredictable and
has a high number of different branches and exceptions, the
models could become quickly unreadable. In these cases, it
may be better to use declarative process models that model
the process as a set of rules that the process should follow.
Although there are several commercial and academic process
mining tools available based on procedural models, there are
currently no comparable tools for working with declarative
models.</p>
      <p>
        In this paper, we present RuM, a novel and easy to use
process mining toolkit based on the declarative modeling language
DECLARE [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. RuM implements process mining techniques
for both standard DECLARE and MP-DECLARE [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], the latter
being the multi-perspective extension of DECLARE supporting
data constraints together with control-flow constraints. RuM
also provides a model editor that is fully MP-DECLARE
compliant and equipped with a chatbot that supports inexpert
users in defining DECLARE constraints using natural language
expressions.
      </p>
      <p>To assess the feasibility of RuM, we conducted a qualitative
user evaluation of which we sketch here the main findings.1
In general, the application was well received and it was
recognized to be timely and highly needed by all participants.</p>
      <p>
        To download RuM and get access to additional
information about the tool, please refer to the RuM project
website: https://rulemining.org. A tutorial on the use of
the tool is available at https://git.io/JUvw4. A short video
screencast showing a quick overview of RuM is available
at https://youtu.be/nXFNDDbOcU0. In [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], we describe the
techniques implemented in RuM in detail. In addition to
what presented in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], we introduce in this paper a new
functionality (process monitoring) and an additional tool that
eases the management and retrieval of models and event logs
(the inventory).
      </p>
      <p>The remainder of this paper is structured as follows.
Section II gives a short overview of the functionalities of RuM and
lists the process mining techniques available in the application.
Section III describes the maturity of the tool by summarizing
the results of our user evaluation and concludes the paper by
spelling out directions for future work.</p>
    </sec>
    <sec id="sec-2">
      <title>II. FUNCTIONAL OVERVIEW</title>
      <p>
        RuM is the first software platform natively designed to
analyze declarative, rule-based process models. To that end, we
have integrated and improved existing prototypes, but also
created completely new features that enhance the user experience
during the process analysis. To cater for the interoperability of
the tool, we resort on existing standards for input and output
files, namely XES [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] for the event logs and decl [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] for the
models.
      </p>
      <p>
        Figure 1 shows the home screen of the tool, giving
direct access to its main functionalities. In the following,
we describe those functionalities and the inventory, with
which the user can save, restore and alter the diverse
artifacts imported from the file system or created during the
mining and analysis of processes and event logs. For the
1For a full description of the user evaluation the reader is referred to [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
sake of space, we shall delve more in the detail of the
novel monitoring functionality and the inventory. For further
information on the whole set of techniques, please refer
to [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the online tutorial (https://git.io/JUvw4) and video
(https://youtu.be/nXFNDDbOcU0).
      </p>
      <sec id="sec-2-1">
        <title>A. Discovery</title>
        <p>
          Figure 2 illustrates the user interface (UI) of the discovery
panel applied to an example event log describing the treatment
of patients suffering the from the sepsis disease in a hospital.
Four methods are available for process discovery: Declare
Miner [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], MINERful [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], MP-Declare Miner [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and
MPMINERful. The MP variants add to the base mining algorithms
a post processing step for discovering data conditions.2 We
remark that MP-MINERful is a novel integration of MINERful
with the post processing step, created specifically for RuM.
        </p>
        <p>The discovery results can be explored by using three
complementary views: through a process map (DECLARE
view), a textual description (textual view), or as a procedural
model (automaton view).3 We remark that these views support
filtering based on activity support and constraint support thus
providing the possibility for users to show/hide outlier
behaviors. The filters are applied on the fly without rediscovering
the model to speed up the user interaction.</p>
      </sec>
      <sec id="sec-2-2">
        <title>B. Conformance Checking</title>
        <p>
          RuM implements three techniques for conformance
checking: Declare Analyzer [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], Declare Replayer [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and
DataAware Declare Replayer.4 The Declare Analyzer takes as input
a model and an event log, and returns constraint activations,
violations, and fulfilments in the input log. The Declare Replayer
and the Data-Aware Declare Replayer report trace alignments.
The Data-Aware Declare Replayer can also account for the
data perspective.
        </p>
        <p>
          2Notice that all the “data-aware” versions of the techniques provided in
RuM support a richer language at the expense of lower efficiency.
3The rendering of the automaton is based on the MINERful library [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
4https://github.com/Clyvv/DataAwareDeclareReplayer
        </p>
        <p>The conformance checking results are presented in groups.
Each group displays the results for a specific trace or a specific
constraint. For each group, the name of the group is displayed
along with general descriptive statistics about the group. To
foster interaction in the process analysis, the user can freely
switch among groups and toggle an extended view for each
group to see more details. This allows users to explore the
results at a high level of detail while also being relatively
compact in terms of user interface [3, Fig. 4].</p>
      </sec>
      <sec id="sec-2-3">
        <title>C. Log Generation</title>
        <p>
          There are two log generation methods available in RuM:
Alloy Log Generator [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and MINERfulLog Generator [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
The main difference between these methods from the user’s
standpoint is that the Alloy Log Generator can also account
for the definition of data conditions in the input process model.
Among other options, the user can specify the percentage of
traces that trivially satisfy the constraints in the output log (that
is, traces that comply with the constraints in the input model
because their activations never occur) and the percentage of
negative traces (i.e., traces that violate at least one of the
constraints in the input model) [3, Fig. 6]. The generated log
can be exported in the XES format.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>D. MP-DECLARE Editor</title>
      <p>
        In order to provide a comprehensive toolset for working
with DECLARE process models, RuM contains a model editor,
which is the first one supporting both standard DECLARE
and MP-DECLARE [3, Fig. 5]. The MP-DECLARE editor uses
the decl file format for importing and exporting the models.
All aspects of the format are supported: activity definitions,
attribute definitions, activity-attribute bindings and constraints
with all the allowed data and time conditions. The used
visualization devices are the same as those of the model
discovery panel, i.e., the model can be visualized using the
standard DECLARE graphical notation, as text or in the form
of an automaton. The editor is also equipped with a chatbot
(Declo [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) supporting the user in designing MP-DECLARE
models using natural language.
      </p>
      <sec id="sec-3-1">
        <title>E. Monitoring</title>
        <p>
          There are two monitoring methods available in RuM:
MPDeclare with Alloy5 and MobuconLTL [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The main
difference between these methods from the user’s standpoint is that
MP-Declare with Alloy can also account for the definition of
data conditions in the input process model.
        </p>
        <p>
          The monitoring tool analyzes the state of each constraint
and updates it for every event in a trace. The states follow
the five-truth-values introduced for DECLARE in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and are
visually depicted with different colors: temporarily satisfied
(though currently satisfied, the constraint can become violated
in the remainder of the trace: green), temporarily violated
(vice-versa, it can become satisfied in the future: yellow),
permanently satisfied (azure) or permanently violated (red).
Orange indicates that there is a conflict between some of the
5https://github.com/b26140/Rule-mining-tool-with-monitor-extension
constraints, i.e., there is no possible sequence of future events
that could satisfy all the conflicting constraints. The user can
replay the whole trace, manually process the events in the trace
one by one or jump to a specific event in the trace.
buttons that can activate a related functionality: e.g., event logs
can be directly re-routed as an input for discovery, whereas
process models can be sent to the conformance checking, log
generation, editor, or monitoring panels.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>F. The Inventory</title>
        <p>Figure 4 illustrates the inventory, a novel artifact aimed at
easing the management of the event logs and process models
in use during the process analysis with RuM. All the files
imported from the file system are retrievable from the inventory
as well as all the discovered and edited process models and
the generated logs. The users can save the intermediate results
of their analysis as so-called snapshots so as to fetch them
later on. Next to each snapshot, the inventory offers action</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>III. MATURITY AND FUTURE REMARKS</title>
      <p>
        A qualitative user study, presented in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], was conducted
to assess the feasibility of RuM. Our aim was to (1) gain
insights into how users from different backgrounds perceived
the application and (2) identify means for improving it. We
selected eight process analysts as participants for our study. Four
of the participants had little to no knowledge of DECLARE,
the other four identified themselves as DECLARE experts. The
study concluded with a post-survey questionnaire consisting of
multi-point Likert scales including the System Usability Scale
(SUS) [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and scales covering satisfaction, expectation
confirmation, continuation intention, and usefulness. The average
SUS score of 81.875 resulting from the evaluation of RuM
shows that the toolkit was very well received and ready to be
used in real scenarios with users having different backgrounds
(a SUS score of 69.69 is considered average while a score
above 80 is considered to be good or excellent [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]).
      </p>
      <p>
        For future work, we aim at extending the user analysis upon
the integration of the user feedback into our implementation
of RuM. Furthermore, we will extend the current capabilities
both from the perspective of the available functionalities (e.g.,
with the mining of branched-DECLARE constraints [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]) and
visualization schemes (e.g., with the graphical editing of
models).
      </p>
    </sec>
    <sec id="sec-5">
      <title>ACKNOWLEDGMENTS</title>
      <p>The authors would like to thank all the participants of the
user evaluation for taking the time to evaluate RuM and for
providing us with invaluable feedback on how RuM can be
improved in the future.</p>
      <p>The work of A. Alman was partly supported by the Estonian
Research Council (project PRG887). The work of C. Di Ciccio
was partly supported by MIUR under grant “Dipartimenti
di eccellenza 2018-2022” of the Department of Computer
Science at Sapienza University of Rome.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Pesic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schonenberg</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “DECLARE:
          <article-title>Full support for loosely-structured processes</article-title>
          ,” in EDOC,
          <year>2007</year>
          , pp.
          <fpage>287</fpage>
          -
          <lpage>300</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Burattin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Sperduti</surname>
          </string-name>
          , “
          <article-title>Conformance checking based on multi-perspective declarative process models,” Expert systems with applications</article-title>
          , vol.
          <volume>65</volume>
          , pp.
          <fpage>194</fpage>
          -
          <lpage>211</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Alman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Haas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Nolte</surname>
          </string-name>
          , “
          <article-title>Rule mining with RuM,” in ICPM, B</article-title>
          . F. van
          <string-name>
            <surname>Dongen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montali</surname>
          </string-name>
          , and M. T. Wynn, Eds. IEEE,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C. W.</given-names>
            <surname>Gunther and H. M. W. Verbeek</surname>
          </string-name>
          , XES
          <article-title>- standard definition, ser</article-title>
          . BPM reports.
          <source>BPMcenter.org</source>
          ,
          <year>2014</year>
          , vol.
          <volume>1409</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Skydanienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ghidini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          , “
          <article-title>A tool for generating event logs from multi-perspective Declare models,” in BPM (Dissertation</article-title>
          /Demos/Industry),
          <year>2018</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Francescomarino</surname>
          </string-name>
          , and T. Kala, “
          <article-title>Parallel algorithms for the automated discovery of declarative process models,” Inf</article-title>
          . Syst., vol.
          <volume>74</volume>
          , pp.
          <fpage>136</fpage>
          -
          <lpage>152</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Ciccio</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Mecella</surname>
          </string-name>
          , “
          <article-title>On the discovery of declarative control flows for artful processes</article-title>
          ,
          <source>” ACM Trans. Manage. Inf. Syst.</source>
          , vol.
          <volume>5</volume>
          , no.
          <issue>4</issue>
          ,
          <string-name>
            <surname>Jan</surname>
          </string-name>
          .
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Leno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>La Rosa, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Polyvyanyy</surname>
          </string-name>
          , “
          <article-title>Automated discovery of declarative process models with correlated data conditions,” Inf</article-title>
          . Syst., vol.
          <volume>89</volume>
          , p.
          <fpage>101482</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Prescher</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Di Ciccio, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          , “
          <article-title>From declarative processes to imperative models,” in SIMPDA. CEUR-WS</article-title>
          .org, Nov.
          <year>2014</year>
          , pp.
          <fpage>162</fpage>
          -
          <lpage>173</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>M. de Leoni</surname>
            ,
            <given-names>F. M.</given-names>
          </string-name>
          <string-name>
            <surname>Maggi</surname>
            , and
            <given-names>W. M. P. van der Aalst,</given-names>
          </string-name>
          “
          <article-title>An alignmentbased framework to check the conformance of declarative process models and to preprocess event-log data,” Inf</article-title>
          . Sys., vol.
          <volume>47</volume>
          , pp.
          <fpage>258</fpage>
          -
          <lpage>277</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Bernardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cimitile</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          , “
          <article-title>Generating event logs through the simulation of Declare models</article-title>
          ,” in EOMAS,
          <year>2015</year>
          , pp.
          <fpage>20</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Alman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Balder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          , and H. van der Aa, “
          <article-title>Declo: A chatbot for user-friendly specification of declarative process models,”</article-title>
          <source>in BPM Demos</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <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>M.</given-names>
            <surname>Westergaard</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “
          <article-title>Monitoring business constraints with linear temporal logic: An approach based on colored automata,” in BPM 2011</article-title>
          . Proceedings,
          <year>2011</year>
          , pp.
          <fpage>132</fpage>
          -
          <lpage>147</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Westergaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Montali</surname>
          </string-name>
          , and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “
          <article-title>Runtime verification of ltl-based declarative process models</article-title>
          ,” in Runtime Verification,
          <year>2011</year>
          ,
          <string-name>
            <given-names>Revised</given-names>
            <surname>Selected</surname>
          </string-name>
          <string-name>
            <surname>Papers</surname>
          </string-name>
          ,
          <year>2011</year>
          , pp.
          <fpage>131</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Brooke</surname>
          </string-name>
          ,
          <article-title>SUS-A quick and dirty usability scale. (in Usability Evaluation in Industry, by</article-title>
          <string-name>
            <given-names>P.W.</given-names>
            <surname>Jordan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thomas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.L.</given-names>
            <surname>McClelland</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Weerdmeester).</surname>
          </string-name>
          CRC Press,
          <year>June 1996</year>
          , iSBN:
          <fpage>9780748404605</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Kortum</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Bangor</surname>
          </string-name>
          , “
          <article-title>Usability ratings for everyday products measured with the system usability scale</article-title>
          ,”
          <source>International Journal of Human-Computer Interaction</source>
          , vol.
          <volume>29</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>67</fpage>
          -
          <lpage>76</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          , “
          <article-title>Efficient discovery of Target-Branched Declare constraints</article-title>
          ,” Inf. Syst., vol.
          <volume>56</volume>
          , pp.
          <fpage>258</fpage>
          -
          <lpage>283</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>