<!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>The Process Highlighter: From Texts to Declarative Processes and Back</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hugo A. Lopez</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>S ren Debois</string-name>
          <email>deboisg@itu.dk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas T. Hildebrandt</string-name>
          <email>hilde@di.ku.dk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Morten Marquard</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Copenhagen University</institution>
          ,
          <country country="DK">Denmark</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>DCR Solutions A/S</institution>
          ,
          <addr-line>Copenhagen</addr-line>
          ,
          <country country="DK">Denmark</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>IT University of Copenhagen</institution>
          ,
          <country country="DK">Denmark</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The adoption of formal models by process specialists has faced two challenges: First, it requires process specialists to get training in formal modeling. Second, the resulting speci cations bear little resemblance wrt. the original descriptions. We introduce a tool that supports translations between natural language descriptions and declarative process models. The resulting models are given in a graphical formalism, DCR Graphs. Traceability is at the core of the tool: Later changes in the process model due to, e.g., ambiguity resolution are traced back into the text. This allows users to either correct and complete their descriptions, or to derive models more re ned than the text. In this paper, we describe the mechanics of the tool and provide examples of its use. Finally, we report on experiences using the tool in a Danish Municipal government.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>This paper describes an implementation of tool support for a method for
extracting declarative process models from textual process descriptions. The tool
aims at reducing the gap between textual descriptions of processes and their
interpretations in a declarative process model. The tool is particularly aimed at
supporting users who are not trained in formal methods.</p>
      <p>
        Both the tool and the method exploit the regularity of contemporary
constraintbased process notations with trace semantics such as DECLARE [
        <xref ref-type="bibr" rid="ref1 ref8">1,8</xref>
        ] or DCR
graphs [
        <xref ref-type="bibr" rid="ref3 ref7">7,3</xref>
        ]: That constraints are expressed as relations between a xed number
of activities. This regularity is actually present and respected already in textual
descriptions of processes. For instance, suppose our text says:
\Payout requires pre-approval by the line manager"
(1)
Then activities \Pre-approval" and \Payout" are related by a DCR or DECLARE
condition-relation. Thus, there is a correspondence between the constraint in
the declarative process model on the one hand and this particular sentence on
the other. The highlighter tool reported on here helps to establish and maintain
that correspondence. It allows users to \mark up" a textual process description,
as if with a yellow marker; the tool then generates a formal declarative DCR
process model from that markup. The correspondence between model and text is
bi-directional: later changes to the model may change the markup and vice versa.
      </p>
      <p>The purpose of the tool is to allow domain experts with some familiarity
with the modelling notation, to easily construct and maintain declarative models.
The tool is currently being used at both industrial and academic environments,
and user feedback indicates that both the development method and the tool are
e ective in establishing and maintaining a correspondences between a textual
process descriptions and a formal constraint-based process models.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Example Usage</title>
      <p>We illustrate the tool via an example process description from the BPM Academic
Initiative4, presented in Fig. 1:</p>
      <p>
        The process includes two major roles, agents (supporting customers outdoor) and clerks
(work indoors). When the insurance company receives a new claim, the clerk calls the
agent to actually check the claim, and creates a new case. As both tasks are executed
by di erent roles (that are mapped to di erent people), the activities are scheduled in
parallel. After the agent has con rmed the claim to the clerk, he supports the customer
with additional assistance (e.g. getting a new id-card from the public authority). After
the clerk has received the con rmation from the agent, she issues a money order for the
claim. If the agent has completed his additional support and the clerk has issued the
money order, the claim is closed.
DCR Graphs are the formal foundations of the process engine developed by
DCR Solutions. For sake of space, we do not provide formal de nitions, referring
the reader to [
        <xref ref-type="bibr" rid="ref4 ref7">7,4</xref>
        ] instead. As the name suggests, a DCR graph is a (directed
multi-)graph: nodes of the graph are activities in a process, and edges denote
constraints between activities. Activities are there to be executed, and relations
regulate the state and executability of activities:
{ A condition relation from A! B means that B can only execute if A already
has been executed, or has been excluded (see below).
{ A response relation A !B indicates that whenever A executes, B changes
state to pending, that is, it needs further execution (or exclusion) of B for
the work ow to be complete.
{ An exclusion (resp. inclusion) relation A!%B (resp. A!+B) indicates that
whenever A is executed, B is excluded from (resp. included in) the work ow:
An excluded activity cannot execute and is ignored as condition and not
required to execute if pending, unless it is re-included by an include relation.
4 https://bpmai.org/foswiki/pub/BPMAcademicInitiative/
      </p>
      <p>CreateProcessModels/ex2_insurance_process.pdf</p>
      <p>Advanced use. Constraints may be explicit (e.g. \after", \and", \if-then"), or
implicit (i.e.: the rst highlighted comma). Other aspects may hinder the mapping
between texts and DCR graphs:
i. A sentence might denote the re nement of an activity. i.e.: \The evaluation
process might contain evaluations regarding chronic and lifelong conditions
of the patient". Here, activity (evaluation) needs to be re ned into several
(separate assessments for lifelong and for chronic diseases).
ii. A sentence might denote internal activities (performed by a single role) as
well as communication activities (i.e.: lines 2{3 in Fig. 1).
iii. Elements identi ed in textual paragraphs might be referenced later.
iv. Relations might include one-to-one, many-to-one and one-to-many cardinality
between activities.</p>
      <p>The tool supports these scenarios. First, multiple markings of the same text will
denote groups (abstractions) and re nements (nested activities). Second, multiple
highlights denote communication activities, one role per marked text. Third, the
tool allows the creation of references to existing elements. Finally, the creation
of relations within the text allows users to include more than one relation per
marked text, with possibly di erent actors and types involved.
2.1</p>
      <p>: : : \and back": Support for Model Changes
In practice, both models and texts may evolve over time. These changes do not
break correspondences with the model. The lter view (c.f.: Fig. 3) shows the
mapping between components and highlighted texts. Elements in the model that
do not have a mapping to the text are shown in red. In the example, those
elements are the new activities that re ne additional support. This distinction
helps users identify deviations from the model, and to correct them either by
linking the model components to the text, or by updating the text description.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Concluding Remarks</title>
      <p>
        Despite a raising interest in the alignment of process models and textual
descriptions [
        <xref ref-type="bibr" rid="ref5 ref6 ref9">6,5,9</xref>
        ], authors are not aware of other works exploring such alignment with
declarative process models. At its current stage, the highlighter depends on the
knowledge of the process modeler to resolve inherent ambiguities coming from
the interpretation of natural language descriptions. In future work, we would like
to explore (semi)-automated declarative process discovery from texts, via the
integration of the highlighter tool with NLP techniques [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>The highlighter tool has been validated in industrial and academic
environments. First, the tool has been introduced to a small number of end-users
from the Syddjurs municipality in Denmark, who have used it to build models
corresponding to the municipal governments internal guidelines on processes for
implementing Section 42 of the Danish Consolidation Act on Social Services,
which describe rights to compensation for loss of earnings awarded to parents of
children with long-term illness or disabilities. Users had a background in law and
social work, and had previously received training in process modelling using DCR
graphs. Users' interaction with the tool resulted in their independent process
models5 End-users reported that the highlighter was e ective and easy to use
for the intended purpose6. Finally, the highlighter tool is currently being used in
B.Sc. and M.Sc. courses on business process modelling at the ITU.
3.1</p>
      <p>
        Availability, Documentation and Screencast
The tool has been implemented by DCR Solutions A/S as part of their set
of tools for declarative process modelling and execution, and is part of their
commercial on-line o ering [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The highlighter tool is free for non-commercial
and academic use. Documentation, installation and further examples of use are
available in our wiki site7. A screencast documenting its usage is available at
https://youtu.be/JB9ueRu_asE.
      </p>
      <p>Acknowledgments. Work supported by the Innovation Fund Denmark project
EcoKnow.org (7050-00034A). This project has received funding from the European Union's
Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
grant agreement BehAPI No.778233.
5 http://www.dcrgraphs.net/Tool?id=7119
6 However, they did report that some aspects of the guidelines, e.g., the criteria an
assessment of a child's special needs must meet to be lawful, were not straightforward
to map to the BPM concepts of \Activity". This concern is orthogonal to the tool
itself: such di culty would manifest also in a pen-and-paper model.
7 http://wiki.dcrgraphs.net</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          v.d.,
          <string-name>
            <surname>Pesic</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>DecSerFlow: Towards a Truly Declarative Service Flow Language</article-title>
          . In: WSFM. pp.
          <volume>1</volume>
          {
          <fpage>23</fpage>
          . LNCS, Springer, Berlin, Heidelberg (Sep
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Debois</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.,
          <string-name>
            <surname>Marquard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Slaats</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The DCR graphs process portal</article-title>
          .
          <source>In: BPM (Demos)</source>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>1789</volume>
          , pp.
          <volume>7</volume>
          {
          <fpage>11</fpage>
          . CEURWS.org (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Debois</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hildebrandt</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The DCR Workbench: Declarative Choreographies for Collaborative Processes</article-title>
          .
          <source>In: Behavioural Types: from Theory to Tools</source>
          , pp.
          <volume>99</volume>
          {
          <fpage>124</fpage>
          . River Publishers (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Debois</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.,
          <string-name>
            <surname>Slaats</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Replication, re nement &amp; reachability: complexity in dynamic condition-response graphs</article-title>
          .
          <source>Acta</source>
          Informatica pp.
          <volume>1</volume>
          {
          <issue>32</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Delicado</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanchez-Ferreres</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmona</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Padro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>NLP4BPM - natural language processing tools for business process management</article-title>
          .
          <source>In: BPM (Demos)</source>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <year>1920</year>
          .
          <article-title>CEUR-WS.org (</article-title>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendling</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Puhlmann</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Process model generation from natural language text</article-title>
          .
          <source>In: CAiSE</source>
          . pp.
          <volume>482</volume>
          {
          <fpage>496</fpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hildebrandt</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukkamala</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          :
          <article-title>Declarative Event-Based Work ow as Distributed Dynamic Condition Response Graphs</article-title>
          .
          <source>In: PLACES. EPTCS</source>
          , vol.
          <volume>69</volume>
          , pp.
          <volume>59</volume>
          {
          <issue>73</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Pesic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schonenberg</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          v.d.: DECLARE:
          <article-title>Full Support for LooselyStructured Processes</article-title>
          . In: EDOC. pp.
          <volume>287</volume>
          {
          <issue>287</issue>
          (Oct
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Riefer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ternis</surname>
            ,
            <given-names>S.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thaler</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Mining process models from natural language text: A state-of-the-art analysis</article-title>
          .
          <source>Multikonferenz Wirtschaftsinformatik (MKWI-16</source>
          ) pp.
          <volume>9</volume>
          {
          <issue>11</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>