<!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 with RuM (Extended Abstract)∗</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anti Alman</string-name>
          <email>anti.alman@ut.ee</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Claudio Di Ciccio</string-name>
          <email>claudio.diciccio@uniroma1.it</email>
          <xref ref-type="aff" rid="aff1">1</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>
        <aff id="aff0">
          <label>0</label>
          <institution>Free University of Bozen-Bolzano</institution>
          ,
          <addr-line>Bolzano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Sapienza University of Rome</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Tartu</institution>
          ,
          <addr-line>Tartu</addr-line>
          ,
          <country country="EE">Estonia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Declarative process modeling languages are especially suitable to model loosely-structured, flexible business processes. One of the most prominent of these languages is Declare. The Declare language can be used for all process mining branches and a plethora of techniques have been implemented to support process mining with Declare. The process mining application RuM integrates multiple Declare-based process mining methods into a single application and is developed to be the starting point for the use of Declare both in industry and academia. RuM has been evaluated by conducting a qualitative user evaluation, the results of which have been used as input for further development. In this paper, we give a short overview of the current functionalities of RuM, including the main improvements made thus far.</p>
      </abstract>
      <kwd-group>
        <kwd>Process analytics</kwd>
        <kwd>Declarative modeling</kwd>
        <kwd>Process mining</kwd>
        <kwd>Process discovery</kwd>
        <kwd>Conformance checking</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        One of the obstacles for the adoption of declarative process mining techniques,
especially in the context of the Declare language [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], has been a lack of comprehensive,
easy-to-use process mining toolkits [22, RC7]. However, this shortcoming has been
recently addressed with the introduction of RuM [
        <xref ref-type="bibr" rid="ref2 ref3">3,2</xref>
        ], which implements various
process mining techniques based on Declare and its multi-perspective extension
MP-Declare [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. RuM is specifically developed to be the starting point for the use
of Declare both in industry and academia.
      </p>
      <p>
        To provide an intuition about the nature and expressiveness of Declare models,
consider the example given in Fig. 1. This model is inspired by the analysis of a
real-world event log of the process of handling patients affected by sepsis [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The
process begins with the emergency room (ER) registration. After that, if the condition
on the Systemic Inflammatory Response Syndrome (SIRS) criteria attribute holds
true, then intravenous (IV) antibiotics have to be administered. The administration
of IV antibiotics must follow the ER triage. The ER sepsis triage has to be executed
[ org:group is different ]
      </p>
      <p>
        [ time:timestamp in [
        <xref ref-type="bibr" rid="ref3">0,3</xref>
        ]ℎ ]
      </p>
      <p>Init
ER registration</p>
      <p>Existence</p>
      <p>ER triage
immediately after ER triage, but with the condition that the actors carrying out the
two activities differ (condition on org:group). Finally, The analysis of the presence
of lactic acid requires that ER sepsis triage has occurred at most 3 hours before.</p>
      <p>
        In this paper, we provide a short overview of the functionalities available in
RuM to operate with process models similar to the one described above (including
additional functionalities not covered in [
        <xref ref-type="bibr" rid="ref2 ref3">3,2</xref>
        ]). RuM is open-source and publicly
available at https://rulemining.org.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Functional Overview</title>
      <p>
        RuM integrates and improves multiple existing prototypes, while also providing novel
features that can be found in RuM only. Interoperability of all modules is ensured
by relying on existing standards, namely XES [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] for the event logs and decl [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]
for the models. The main functionalities of RuM are: process discovery, conformance
checking, log generation, model editor, and monitoring. Furthermore, RuM features an
inventory system allowing for process models and event logs to be reused easily across
the application. In the following, we describe the functionalities of RuM (including the
inventory) in more detail. We remark that the conformance results and monitoring
views, the model editor, and the inventory panel were designed and developed from
ground-up specifically for RuM.
      </p>
      <p>
        Discovery. Process discovery is implemented using Declare Miner [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and
MINERful [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], both of which can be further augmented by discovering data conditions
(based on [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]) and time conditions (developed specifically for RuM). As depicted in
Fig. 2(a), the discovered model can be explored by using three complementary views:4
Declare view: it employs the standard graphical notation of Declare. Activities
are represented as rectangles, while constraints are represented either above the
activities (unary constraints) or as lines between the activities (both with support
percentages).
      </p>
      <p>Textual view: it describes the model using natural language sentences that are easy
to understand without any prior knowledge of Declare. This representation
was developed specifically for RuM and meant for users who are less familiar
with the standard graphical notation.</p>
      <p>Automaton view: it displays the discovered process model as a finite-state automaton
based on the a conjunction of the LTLf formulas of each discovered constraint.
4All three views enable filtering based on activity support and constraint support.
(a) Process discovery</p>
      <p>
        (b) Conformance checking
(c) MP-Declare editor
(d) Log generation
(e) Monitoring
(f) Inventory
Conformance checking. The conformance checking functionality is based on three
techniques: Declare Analyzer [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] detects activations, violations, and fulfillments;
Declare Replayer [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and Data-Aware Declare Replayer5 report on trace alignments.
As shown in Fig. 2(b), the results are presented in groups, each displaying the outcome
for a specific trace or a specific constraint. For every group, its name is displayed
along with general descriptive statistics. The user can freely switch among groups
and toggle an extended view to read more details. In this way, users can explore the
results at a high level of detail while also keeping the user interface relatively compact.
MP-Declare editing. RuM features the first fully MP-Declare compliant model
editor, depicted in Fig. 2(c). Models are imported and exported in the decl file
for5https://github.com/Clyvv/DataAwareDeclareReplayer
mat [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], which allows for activity definitions, attribute definitions, activity-attribute
bindings, Declare constraints, and data and time conditions of MP-Declare. The
visualization of the entire model is updated on-the-fly and the same views (with minor
modifications) are provided as in Section 2. Furthermore, the user can add constraints
and data conditions using natural language sentences, which can be provided both
via voice and text through a simple chatbot [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Log generation. To generate logs, RuM resorts to the AlloyLogGenerator [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and
MINERful Log Generator [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], the former of which can also account for the data
conditions in the input process model. As illustrated in Fig. 2(d), the user can specify
the percentage of vacuous traces (i.e., traces fulfilling the constraints because the
constraints are never activated), the number of negative traces (i.e., traces violating
at least one constraint), and the case attributes of the generated event log.
Monitoring. Figure 2(e) illustrates the monitoring panel, through which the user can
analyze the state of each constraint for every event sequentially. The states follow the
four-truth-values introduced in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]: temporarily satisfied (satisfied given the events
thus far, but can be violated in the future: green), temporarily violated (violated,
but can be satisfied in the future: yellow), permanently satisfied (blue), permanently
violated (red). Additionally, orange indicates that some constraints are conflicting,
i.e., there is no possible sequence of future events that could satisfy all the conflicting
constraints. The user can replay the whole trace automatically, manually process the
events in the trace one by one, or jump to a specific event in the trace. This functionality
is implemented using MP-Declare with Alloy6 and MobuconLTL [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], the former of
which accounts for the definition of data conditions in the input process model.
Inventory. The inventory is a novel artifact aimed at easing the management of
the event logs and process models in use during the process analysis with RuM.
As depicted in Fig. 2(f), all the files imported from the file system are retrievable
from the inventory and intermediate results can be stored directly in the inventory
as snapshots. Next to each snapshot, the inventory offers action buttons that can
activate a related functionality. For example, event logs can be directly re-routed as
inputs for discovery, process models can be sent to log generation, and so on.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>User Evaluation</title>
      <p>
        To assess the feasibility of RuM, we conducted a qualitative user evaluation. Table 1
shows the results of the post-study survey. The post-survey included the System
Usability Scale (SUS) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and scales covering satisfaction, expectation confirmation,
future use intentions, and usefulness [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The study involved eight participants: four
BPM experts with little to no knowledge of Declare and four Declare experts.
Overall, RuM was rated high on all scales. For example, RuM scored 81:875 on the
6https://github.com/b26140/Rule-mining-tool-with-monitor-extension
SUS scale (69:69 is considered the average, while a score above 80 is considered to
be good or excellent [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]). However, there was a significant difference between BPM
and Declare experts. RuM was rated higher by BPM experts on all scales except
satisfaction, which was rated as 4:5 by both groups. The largest differences between
the two groups are SUS score (85 to 78:75) and future use intentions (4:5 to 3:833).
This discrepancy can point towards Declare experts potentially being less sensitive
to the improvements in the ease of use of Declare constraints. For a more detailed
discussion on the study, we refer the interested reader to [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In this paper, we presented an overview of the functionalities currently available in
RuM alongside the results of the post-study survey from a qualitative user evaluation.
The results of the post-study survey show that RuM is well-usable for both novice and
expert users. Furthermore, we believe that RuM provides all the essential and many
additional functionalities necessary for process mining when using the Declare
language and its extension MP-Declare.</p>
      <p>
        For future work, we plan to explore the feasibility of developing a visual editor
for MP-Declare models, so that elements can be added, deleted and modified in
the graphical view directly. Another avenue for future work is to extend the current
capabilities to support discovery of branched-Declare constraints [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Furthermore,
we will investigate the integration of functionalities provided by other declarative
frameworks for process analysis such as DCR Graphs [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], DPIL [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and WoMan [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
We will also continue working based on the feedback received during the user
evaluation. While many improvements have already been made, we have not yet exhausted
all of the ideas provided by the participants of the evaluation.
      </p>
      <p>Acknowledgements. The work of A. Alman was supported by the Estonian
Research Council (project PRG1226) and ERDF via the IT Academy Program. The
work of C. Di Ciccio was partly supported by the Italian MUR under grant
\Dipartimenti di eccellenza 2018-2022" of the Department of Computer Science at Sapienza,
and by the \SPECTRA" Sapienza research project.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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
          <string-name>
            <surname>H. van der Aa. Declo:</surname>
          </string-name>
          <article-title>A chatbot for user-friendly specification of declarative process models</article-title>
          .
          <source>In BPM (PhD/Demos)</source>
          , pages
          <fpage>122</fpage>
          {
          <fpage>126</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <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>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          .
          <article-title>Rule mining in action: The RuM toolkit</article-title>
          .
          <source>In ICPM DC/Tools</source>
          , pages
          <volume>51</volume>
          {
          <fpage>54</fpage>
          ,
          <year>2020</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</article-title>
          .
          <source>In ICPM</source>
          , pages
          <volume>121</volume>
          {
          <fpage>128</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Bhattacherjee</surname>
          </string-name>
          .
          <article-title>Understanding information systems continuance: An expectationconfirmation model</article-title>
          .
          <source>MIS Q.</source>
          ,
          <volume>25</volume>
          (
          <issue>3</issue>
          ):
          <volume>351</volume>
          {
          <fpage>370</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>J.</given-names>
            <surname>Brooke</surname>
          </string-name>
          .
          <article-title>SUS: a `quick and dirty' usability scale</article-title>
          .
          <source>Usability evaluation in industry, page 189</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <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</article-title>
          .
          <source>Expert Syst. Appl.</source>
          ,
          <volume>65</volume>
          :
          <fpage>194</fpage>
          {
          <fpage>211</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>C. D. Ciccio</surname>
            ,
            <given-names>M. L.</given-names>
          </string-name>
          <string-name>
            <surname>Bernardi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Cimitile</surname>
            , and
            <given-names>F. M.</given-names>
          </string-name>
          <string-name>
            <surname>Maggi</surname>
          </string-name>
          .
          <article-title>Generating event logs through the simulation of Declare models</article-title>
          .
          <source>In EOMAS@CAiSE</source>
          , pages
          <volume>20</volume>
          {
          <fpage>36</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <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>Aligning event logs and declarative process models for conformance checking</article-title>
          .
          <source>In BPM</source>
          , pages
          <volume>82</volume>
          {
          <fpage>97</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <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.,
          <volume>56</volume>
          :
          <fpage>258</fpage>
          {
          <fpage>283</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>C. Di Ciccio</surname>
            and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Mecella</surname>
          </string-name>
          .
          <article-title>On the discovery of declarative control flows for artful processes</article-title>
          .
          <source>ACM Trans. Manag. Inf. Syst.</source>
          ,
          <volume>5</volume>
          (
          <issue>4</issue>
          ):
          <volume>24</volume>
          :1{
          <fpage>24</fpage>
          :
          <fpage>37</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferilli</surname>
          </string-name>
          . Woman:
          <article-title>Logic-based workflow learning and management</article-title>
          .
          <source>IEEE Trans. Syst. Man Cybern. Syst.</source>
          ,
          <volume>44</volume>
          (
          <issue>6</issue>
          ):
          <volume>744</volume>
          {
          <fpage>756</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>C. W.</given-names>
            <surname>Gunther</surname>
          </string-name>
          and
          <string-name>
            <given-names>H. M. W.</given-names>
            <surname>Verbeek</surname>
          </string-name>
          . XES - standard definition, volume
          <volume>1409</volume>
          of BPM reports.
          <source>BPMcenter.org</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <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>Int. J. Hum. Comput. Interact.</source>
          ,
          <volume>29</volume>
          (
          <issue>2</issue>
          ):
          <volume>67</volume>
          {
          <fpage>76</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <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</article-title>
          .
          <source>Inf. Syst.</source>
          ,
          <volume>89</volume>
          :
          <fpage>101482</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>F. M. Maggi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Di Ciccio</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Di Francescomarino</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Kala</surname>
          </string-name>
          .
          <article-title>Parallel algorithms for the automated discovery of declarative process models</article-title>
          .
          <source>Inf</source>
          . Syst.,
          <volume>74</volume>
          (Part):
          <volume>136</volume>
          {
          <fpage>152</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>F. M. Maggi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montali</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Westergaard</surname>
            , and
            <given-names>W. M. P. van der Aalst.</given-names>
          </string-name>
          <article-title>Monitoring business constraints with Linear Temporal Logic: An approach based on colored automata</article-title>
          .
          <source>In BPM</source>
          , pages
          <volume>132</volume>
          {
          <fpage>147</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>F. M. Maggi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Westergaard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montali</surname>
            , and
            <given-names>W. M. P. van der Aalst.</given-names>
          </string-name>
          <article-title>Runtime verification of LTL-based declarative process models</article-title>
          .
          <source>In RV</source>
          , pages
          <volume>131</volume>
          {
          <fpage>146</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>F.</given-names>
            <surname>Mannhardt</surname>
          </string-name>
          , M. de Leoni,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Reijers</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
            , and
            <given-names>P. J.</given-names>
          </string-name>
          <string-name>
            <surname>Toussaint</surname>
          </string-name>
          .
          <article-title>Guided process discovery - A pattern-based approach</article-title>
          . Inf. Syst.,
          <volume>76</volume>
          :1{
          <fpage>18</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>M. Marquard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Shahzad</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Slaats</surname>
          </string-name>
          .
          <article-title>Web-based modelling and collaborative simulation of declarative processes</article-title>
          .
          <source>In BPM</source>
          , pages
          <volume>209</volume>
          {
          <fpage>225</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. S. Schonig and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zeising</surname>
          </string-name>
          .
          <article-title>The DPIL framework: Tool support for agile and resource-aware business processes</article-title>
          .
          <source>In BPM (Demos)</source>
          , pages
          <fpage>125</fpage>
          {
          <fpage>129</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <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</article-title>
          .
          <source>In BPM (Dissertation/Demos/Industry)</source>
          , pages
          <fpage>111</fpage>
          {
          <fpage>115</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>T.</given-names>
            <surname>Slaats</surname>
          </string-name>
          .
          <article-title>Declarative and hybrid process discovery: Recent advances and open challenges</article-title>
          .
          <source>J. Data Semant.</source>
          ,
          <volume>9</volume>
          (
          <issue>1</issue>
          ):3{
          <fpage>20</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
            and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Pesic</surname>
          </string-name>
          . DecSerFlow:
          <article-title>Towards a truly declarative service flow language</article-title>
          .
          <source>In WS-FM</source>
          , pages
          <volume>1</volume>
          {
          <fpage>23</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>