<!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>How to (re)design declarative process notations? A view from the lens of cognitive efectiveness frameworks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hugo A. López</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vít Dexter Simon</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Copenhagen, Computer Science Department.</institution>
          <addr-line>Universitetsparken 1, 2100 Copenhagen</addr-line>
          ,
          <country country="DK">Denmark</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Declarative process modelling notations are a family of approaches where events obey a set of constraints rather than specific flows. While declarative models can express in a few constructs a large set of process behaviours, there is little adoption of declarative approaches compared to their imperative counterparts. One possible reason is that while expressive, there has not been enough focus on the user-centred design of declarative notations. In this paper, we explore how cognitive efectiveness frameworks could improve the development of declarative notations that support novice and expert users. In this paper, we analyse one representative declarative notation (DCR graphs) against two cognitive efectiveness frameworks. Our analysis suggests thirteen areas of improvement. For notation developers, we provide theory-backed guidelines, while for researchers in process models we outline hypotheses in the understandability of process models for further empirical testing.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Declarative Process Models</kwd>
        <kwd>DCR graphs</kwd>
        <kwd>Cognitive Efectiveness</kwd>
        <kwd>Human-Computer Interaction</kwd>
        <kwd>Physics of Notations</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Process models are a fundamental piece in the understanding, analysis, optimisation and
implementation of business processes, providing a common understanding for business and technical
users alike. While a plethora of notations supporting process models exists, it is commonly
accepted that most notations fall between the imperative and the declarative modelling
spectrum [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Imperative notations such as BPMN facilitate the description of sequential process
lfows, whereas declarative specifications like DECLARE [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], CMMN [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], or DCR graphs [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
describe cause-efect relations between events. While semantic aspects of declarative processes
have been amply studied, there has been relatively less research on how to engineer declarative
notations such that they support model understanding, and how to equip notations with features
that allow for understanding when the complexity of models increases.
      </p>
      <p>
        This paper studies the cognitive efectiveness of a declarative process modelling notation,
the Dynamic Condition Response (DCR) graphs. DCR is a graph-based notation where events
are constrained by behavioural constraints (similar to other formal notations, for example,
DECLARE). The choice of notation is not incidental: compared to DECLARE, DCR is actively
used by modellers in industry, and it is integrated into KMD Workzone, a case management
solution provided to central government institutions in Denmark [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], Australia and Japan.
Figure 1 introduces a simple DCR model. Intuitively, this process describes the interactions
between diferent organisations to book a meeting. Events (rounded squares) denote what can
happen in the process. Relations (arrows) impose constraints on when events can be executed.
For instance, the condition relation (i.e., →∙ ) says that the organization A cannot propose
dates unless (a user) has executed create case. With a response relation (i.e., →∙ ) we impose
an obligation: once (organization A) has proposed dates, then (organization B) must accept
them. Events can be placed in or out of the context: an event out of context (denoted with a
dashed border) can be included using the inclusion relation (i.e., →+) and removed again using
an exclusion relation (i.e., →%). Event collections (i.e., arrange meeting) simplify the visual
notation by collapsing into one the multiple relations that enclosed events have to events from
the outside. As with many other software notations, the notation has evolved over time to
cover new business requirements. This has made the formalism and accompanying notation
change and grow from its original presentation in 2011 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. We use its most recent iteration
including all the extensions, with a total of 32 distinct visual elements. Also, industrial DCR
models are orders of magnitude larger than Figure 1, with models that can reach the hundreds
of constraints, events and collections1. While research has focused on building a language that
is expressive and robust, how to represent concepts and control visual complexity has received
far less attention, and its oficial language documentation 2 does not provide empirical evidence
regarding the design rationale, nor about how the design best fits the potential users and the
1See, for example, the adoption consideration section in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
2https://documentation.dcr.design/
modelling tasks at hand.
      </p>
      <p>
        This paper presents an initial investigation of the factors afecting the understandability of
DCR graphs. In a purely empirical cycle, we focus on the observation stage, with the goal of
building a set of hypotheses that can be further tested via user studies. We conduct a systematic
analysis using two of the most widespread cognitive efectiveness frameworks: the Physics
of Notations (PoN) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and SEQUAL [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. They provide a set of general, notation-agnostic
guidelines on how to maximise the perceptual properties of graphical notations and modelling
tools that are backed by empirical evidence. Thus, the result of this paper is 1) a critical analysis
of the current status of DCR according to cognitive efectiveness frameworks, and 2) a set
of guidelines for improvement of the notation. The chosen frameworks provide us with an
unbiased yardstick that can be used to compare against other notations and complements earlier
work on tailor-made DCR quality frameworks from the perspective of experts [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>The paper is structured as follows. Preliminaries for DCR, PoN and SEQUAL are introduced
in Section 2. The analysis of DCR notation against PoN is presented in Section 3. The analysis
using the SEQUAL framework is presented in Section 4. Suggestions for improvement of the
notation are presented in Section 5. Related work is presented in Section 6. The paper concludes
in Section 7.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Preliminaries</title>
      <sec id="sec-2-1">
        <title>2.1. DCR graphs and its extensions</title>
        <p>
          DCR graphs [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is a modelling notation where processes are collections of events and constraints.
We introduce DCR via a process model in execution (see Figure 2), using labels , , , . . . to
refer to specific events. We refer to [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] for the formal definition. Figure 4 in Appendix shows
the metamodel of DCR and its extensions.
        </p>
        <p>
          A DCR graph is a graph containing a set of events and event collections, a set of relations, and
a marking. Graphs contain static and dynamic components. Starting with the static components,
events can be atomic (e.g., ) or represent event collections (e.g.,  ). They can have 0, 1 or
multiple roles assigned to them (e.g., , , ). An event may have a data payload (e.g., ) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ],
execute computations (e.g., ), or determine their value via DMN tables (e.g., ) [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Finally,
events can be linked to other DCR graphs using networks (e.g., ) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Relations constraint
events. DCR has ten types of relations. First, precedence relations such as condition (e.g., relation
→∙ ), milestone (e.g., relation →◇ ), and precondition (e.g., relation →♦ ), allow the
execution of the consequent once the precedent has been executed. Second, obligations such as
response (e.g., relation →∙ ) and no-response (e.g., relation →∙ x) modify the pending state
of the consequent depending on the execution of the antecedent. Finally, alternative relations
such as include (e.g., relation  →+), exclude (e.g., relation →%) and logical include (e.g.,
relation →− ± ) modify the inclusion state of each event depending on the execution of the
antecedent. Relations can be applied to the same element (e.g., relation →%), or multiple
relations can link a group of events (e.g., →∙  and →∙ ). In addition, relations can have
guarded expressions (e.g., relation − →−− ±&gt;10 ), and conditions and responses may define how
long an event will be delayed (e.g., relation →−−− ∙  1 ) or time boundaries when an event
should be executed (e.g., relation −∙ →−−   5 ) [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>
          The dynamic components include the execution state. Each event/collection has a marking.
An event can be included (events using solid borders, e.g., ), excluded (events with dashed
borders, e.g., ), pending (events with “!", e.g., ), executed (events with ✓, e.g., ) or be in a
combination of states (e.g.,  ). It is the marking that defines whether an event can be executed
or not: An arbitrary event is enabled if i) it is included, and ii) all the events with precedence
relations towards the event have either been executed or are excluded. Also, part of the dynamic
aspects involves access control (e.g., ), which binds the role of an activity according to the
evaluation of an expression. Event collections include a stateless nesting construction (e.g.,
 ) that enables modellers to use a single constraint to bind multiple events [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], a subprocess
construction (e.g.,  ) that has the same marking as a regular event but whose state depends on
the marking of its enclosing events and a multi-instance subprocess (e.g.,  ) that creates copies
of each of the enclosed events and relations at runtime [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], bound to normal events via the
spawn relation. Finally, multiple events can be grouped into one data form (e.g., ) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. The Physics of Notations (PoN)</title>
        <p>
          The Physics of Notations [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] is a scientific framework for the analysis of cognitive efectiveness
in visual notations. It considers nine dimensions:
2.2.1. Semiotic Clarity
studies how symbols and concepts relate. We consider this principle satisfied only if symbols
and concepts map 1:1. Misalignments can be categorised as: symbol redundancy: one concept is
represented by multiple symbols, symbol overload: multiple concepts are visualised by the same
symbol, symbol excess: at least one symbol has no semantics, and symbol deficit: no symbol
matches one or more concepts.
2.2.2. Perceptual Discriminability
measures the ease at which a user can distinguish graphical symbols apart. Low discriminability
renders diagrams less efective in conveying information and increases the cognitive load for
novice users [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Visual variables represent quantifiable properties of visual objects. Retinal
variables include shape, size, colour, brightness, orientation, texture, and planar variables include
horizontal and vertical positioning in a canvas. Their combination allows for an estimation of
the visual distance between symbols, as well as how easy is to diferentiate them. This guideline
is satisfied if the combination of visual variables distinguishes each concept apart.
2.2.3. Visual Expressiveness
analyses the use of visual variables and their diversity across the visual notation focusing on
the visual distance and diferences between individual symbols. The expression of a concept
using a range of visual variables results in a richer representation that exploits multiple visual
communication channels. We consider this guideline satisfied if there is more than one visual
variable diferentiating concepts.
Relations
1
6
7
8
9
10
        </p>
        <p>Condition
Response
Include
Exclude
Milestone
12
14
20
9</p>
        <p>23
11 Spawn
12 Logical Include
13 Pre-condition
14 Value
15 No-response
22
24
17
2</p>
        <p>
          18
Collections
16 Nesting
17 Single-Instance Subprocess
18 Multi-Instance Subprocess
19 Form
Relation Modifiers
24 Timed Constraint 25 Data Guard
21 Pending Event 22 Executed Event 23 Access Control
2.2.4. Semantic Transparency
studies the intuitiveness of the notation. An intuitive symbol reduces the cognitive load placed
on the reader [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], who can shift the attention to harder-to-decode elements. Semantically
perverse symbols imply a diferent/opposite meaning than the concept. Opaque symbols have
an arbitrary meaning. Translucent symbols provide hints to their concept but need initial
explanations. Finally, semantic immediate symbols are linked with their concept without
explanations. We consider this guideline satisfied if all symbols are semantically immediate.
2.2.5. Complexity Management
analyses the techniques used by a notation to manage large quantities of information without
overwhelming users [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. The limitations of human perception and comprehension render
diagrams over a specific size less efective to use [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], in particular for novice users that do
not have clustering and decoding capabilities to work with highly complex graphs [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. Two
techniques are considered: first, hierarchy allows systems to be represented at diferent levels of
detail, allowing modellers to control the complexity at each level. Second, with modularisation
large diagrams are divided into sub-systems, reducing the number of elements in scope and
encapsulating sub-systems as single elements. This guideline will be fully satisfied if both
techniques are present, partially satisfied if at least one technique is present, and not satisfied if
none can be found.
        </p>
        <sec id="sec-2-2-1">
          <title>2.2.6. Cognitive Integration</title>
          <p>studies combinations of diagrams and their understandability. Homogeneous integration occurs
when separate diagrams capture diferent areas of the system/diferent levels of abstraction.
Heterogeneous integration presents varying views of an area of interest. Cognitive integration
includes conceptual integration as techniques to link and contextualise diagrams, and perceptual
integration, which describes navigation between diagrams and the user’s ability to find their
destination. This guideline will be satisfied if both techniques are present in the notation.</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>2.2.7. Dual Coding</title>
          <p>
            studies specific use cases where textual labels objectively improve the efectiveness of the
notation. PoN suggests that text should always be used as a supplement that provides further
clarification to existing encodings realised by one of the eight visual variables [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ]. In particular,
PoN supports the use of texts in two cases: first, by adding annotations directly to diagrams,
users can obtain detailed descriptions without referring to documentation or another external
ifle. Second, in the usage of hybrid coding (text+graphics), users can reinforce and complement
the meaning of symbols. This guideline is fully satisfied if both techniques are present in the
notation, partially satisfied if one is implemented, and violated otherwise.
          </p>
        </sec>
        <sec id="sec-2-2-3">
          <title>2.2.8. Graphic Economy</title>
          <p>
            large symbol vocabularies are directly related to a decrease in notation efectiveness [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ].
Moreover, large vocabularies are challenging for novice users who may be unable to understand
the diagrams without constant interaction with a legend or documentation. Thus, shifting
some aspects of the notation to textual descriptions should be considered. Strategies to reduce
complexity include: 1) reducing semantic complexity, 2) introducing symbol deficit, and 3)
increasing visual expressiveness. We consider this guideline partially satisfied if the symbol
vocabulary is below Moody’s threshold of 40 elements [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ] and at least one graphic economy
technique has been implemented and fully satisfied if all techniques are present.
2.2.9. Cognitive Fit
studies how audiences require diferent representations of information for diferent types of
tasks. Novice users are susceptible to large vocabularies, whereas experts can cluster and parse
larger numbers of information as one. Providing an extended vocabulary for novices/experts
is not enough. Notation variants need to be chosen in a sensible way for each user type (e.g.,
using discriminated and transparent symbols in novice variants). Moreover, extending the
vocabulary to cater for diferent types of users can reduce the efectiveness for each user type in
isolation [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ] This guideline is partially satisfied if the notation provides diferent representations
depending on user types, and fully satisfied if the variants of the language are discriminate and
implement design specific design principles for each user type.
          </p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. SEQUAL</title>
        <p>
          The SEQUAL framework [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] defines guidelines for the evaluation of modelling tools. We use
SEQUAL’s version for business process models [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], which considers seven dimensions. We
focus on those concerning graphical notations:
        </p>
        <sec id="sec-2-3-1">
          <title>2.3.1. Empirical Quality</title>
          <p>collects the traits of visual or textual communication used in models and their empirical impact
on understandability. SEQUAL highlights that extensive use of colour might confuse a large
minority of subjects with colour vision deficiency. Therefore, its range should be limited to
seven colours. Moreover, certain colours are designed to convey a specific type of information.
Red, for instance, is considered to have a negative connotation. Finally, SEQUAL suggests a
consistent use of a colour code to limit the association of diferent meanings to the same variable.
Other considerations in this dimension include emphasis mechanisms such as changes in the
size variable and the use of typographical emphasis in text labels.
2.3.2. Social Quality
this dimension studies the level of agreement on three dimensions: knowledge, interpretation,
and model. It evaluates each dimension as an absolute or a relative agreement. We will focus
on two aspects of social quality. First, the addition of naming conventions as an aid for users to
identify objects thanks to familiar forms. Second, language documentation - clear documentation
of language concepts, grammar and visual notation improves the users’ understanding of the
language and inherently increases the chances of agreement in individuals’ comprehension of
provided models.
3. Cognitive Efectiveness of DCR against PoN
We carried out a systematic analysis of DCR against the PoN and SEQUAL dimensions described
in the previous section. The analysis included the definition of metrics for the analysis (that are
not provided in the frameworks studied) followed by an independent analysis, that was revised
until reaching an agreement with a second author, that has five years of experience teaching
DCR graphs.</p>
        </sec>
        <sec id="sec-2-3-2">
          <title>3.0.1. Semiotic Clarity</title>
          <p>Events and collections are depicted using the same shape variable. The adherence to the 1:1
correspondence in the context of events is not met as the notation is overloaded to represent
both the existence of events and the efects of both computations and data events. Figure 2
presents two examples: data events O and X have diferent types but are represented equally,
and computational events G and Y compute diferent expressions. Continuing with relations,
DCR contains ten relation types, and each type is depicted by a unique combination of a coloured
arrow and an arrowhead (c.f. Figure 2). Note that while the semiotic clarity principle is observed,
the symbols used to diferentiate relations are very similar (c.f.: perceptual discriminability).
Overall, we found that DCR notation presents a symbol deficit corresponding to the semantic
concepts used. However, we consider this choice justified and supported by the graphic economy
principle, restricting the vocabulary in favour of understandability.</p>
        </sec>
        <sec id="sec-2-3-3">
          <title>3.0.2. Perceptual Discriminability</title>
          <p>Events and relations are diferentiable using the shape variable. However, a slight modification
of the rectangular shape is used to diferentiate events and (sub)processes (see legends 1, 18 and
19 in Figure 2). At the same time, events get their borders, icons and colours modified to denote
a change in their type, their connection with other graphs, and their execution state (see legends
1, 2, 3, 4, 5, 18, &amp; 20). While events, processes and sub-processes are identified by their shape and
colour variables, colour is user-editable, removing it from the determinant variables. Focusing
on shape only, all types of events use rounded squares, making them indistinguishable. Notice
that while events may use text annotations to describe their semantics, this has zero visual
distance according to PoN. Relations are depicted using shape and colour variables including a
customised arrowhead. However, arrowheads are small and very similar in some cases (e.g.,
+ for include and ± for logical include). The small size of the symbols makes their efect on
the user’s pre-attentive processing of the elements debatable. Moreover, some occurrences
of symbol overload are identified where a symbol (e.g., a pre-condition →♦ ) has the same
behaviour as the combination of others (e.g., a milestone →◇ and a condition →∙ ). Colour is
the second variable used to distinguish rules. In most cases, the used colours are far in their
colour spectrum, aiding distinguishability. We can document two pairs of relations where colour
variables are the same: logical includ→e− ± &amp; include →+, and pre-condition →♦ &amp; condition
→∙ . These rules share similarities from a semantics perspective which is likely the motivation
behind their identical colour representation.</p>
        </sec>
        <sec id="sec-2-3-4">
          <title>3.0.3. Semantic Transparency</title>
          <p>
            DCR graphs is a conceptual modelling notation, thus, its notation does not include real-life
objects. Entities are represented by geometric shapes with additional modifiers. The choice of
modifiers ranges from translucent to perverse:
• Semantic transparent: an executed event is visualised with a green checkmark. This
combination of shape and colour is attributed to successful execution.
• Semantic opaque or perverse: a data event is depicted with a “turning page” modifier,
whose visual efect may be confusing as users may interpret it as an event having multiple
steps or a document. Moreover, the use of the same notation for relations (the same arrow)
may be perverse as users might associate the same meaning to all relations. Relations in
DCR graphs denote constraints with diferent semantics, however, their representation as
arrows might confuse novice users with a process modelling background, where arrows
represent direct-follow-relations (e.g., BPMN [
            <xref ref-type="bibr" rid="ref20">20</xref>
            ]).
          </p>
          <p>On several occasions, event modifiers use text in their visual notation. For instance, grouping
types (forms, sub-processes, and nesting) are highlighted by the presence of the initial letter of
its type. While PoN does not explicitly evaluate the use of text in semantic transparency, we
consider the choice of letters as an example of semantically perverse objects when considering
the cultural background. Initial letters may generate recall for native English speakers only and
create confusion for other audiences.</p>
          <p>
            Relations in DCR graphs describe behavioural constraints, and the choice of representation via
arrows might be misleading as explained above. The other variable used in their representation
is colour. The use of green and red colours for the include and exclude relations provides a hint
of a positive or a negative efect of the rule; nonetheless, they can be classified as semantically
translucent at best. Other colours, such as brown and violet, are clear examples of semantically
opaque elements. Similarly, the choice of characters as arrowheads (see uses of “→%" in Figure 2)
are classified as semantically opaque. Finally, relations can combine events and event collections
(see Figure 3, left-hand side). They use a spatial arrangement to express the relationship between
the child and the parent event. Using the principle of the spatial enclosure is known to be highly
semantically transparent compared to connecting lines [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ].
          </p>
        </sec>
        <sec id="sec-2-3-5">
          <title>3.0.4. Complexity Management</title>
          <p>We observe one complexity management mechanism: event nesting3. Nesting defines a visual
hierarchy between a container and its enclosed events (see Figure 3). While nesting does not
remove the essential complexity of the model, it does reduce accidental complexity (that is, the
complexity originating from the graphical representation), and it can improve the clarity of the
model.</p>
        </sec>
        <sec id="sec-2-3-6">
          <title>3.0.5. Cognitive Integration</title>
          <p>
            Homogeneous integration is present via the introduction of global events that synchronise
the execution network of DCR models. While there is a formal execution engine capable of
integrating networks of DCR graphs [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ], the graphical notation provides only symbols to denote
when an event is shared between graphs, lacking explicit constructs to denote networks of graphs.
Moreover, DCR presents several remotely similar heterogeneous integration mechanisms. With
3The notation mentions an additional type “transactional subprocesses” but its usage could not be replicated in our
tests
|Events| = 5
|Relations| = 6
the Process Highlighter [
            <xref ref-type="bibr" rid="ref21">21</xref>
            ]. each processing element is linked with textual annotations. Other
integrations include the link between simulation and DCR notation.
          </p>
          <p>
            DCR networks would play a significant role in developing complexity management
mechanisms. Developing a layer-based set of homogeneous diagrams with varying degrees of detail,
similar to a process architecture diagram [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ] will help both conceptual and perceptual
integration. Notably, having a “root” diagram provides the user with a starting point and navigation
capabilities to deeper layers of the process hierarchy [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ]. Finally, we do not observe navigation
capabilities for DCR graphs. While in imperative process notations there is a clear notion of
start/end events, in declarative notations like DCR, the ability to execute events in DCR is
entirely dependent on the marking and the constraints of a given event. This complicates the
definition of layouts that could be fitted to users’ reading behaviour, requiring users to perform
a full graph exploration to orient themselves on what can be done and how to achieve their
goals.
          </p>
        </sec>
        <sec id="sec-2-3-7">
          <title>3.0.6. Visual Expressiveness</title>
          <p>Shape, and in the case of relations, colour, is the sole information-carrying variable used by
DCR. While colour should not be the only deciding variable, it is highly efective in reducing
cognitive load. Other variables such as texture, horizontal and vertical position and size, are
either used seldom (e.g., dashed texture for excluded events) or are free variables. The next
variable used is text. However, PoN discourages the use of text as means to encode semantic
elements: while textual elements allow to precisely label objects, they increase the cognitive
load on the users’ side and provide no value during pre-attentive processing. Moreover, labels
are often crucial on the sentence level where they distinguish individual object instances. This
cannot be achieved if the notation uses text labels to identify symbol types.</p>
        </sec>
        <sec id="sec-2-3-8">
          <title>3.0.7. Dual Coding</title>
          <p>
            The principle of dual coding is covered in annotations and symbol/text combinations.
Annotations are not directly represented in the notation, and users need to shift focus onto diferent
artefacts in order to integrate additional information. However, while the notation does not
support annotations, tool support provides users with integrations with source information
and event explanations, that have a positive impact on process model comprehension [
            <xref ref-type="bibr" rid="ref23">23</xref>
            ].
Regarding hybrid text/symbol combinations, the use of hybrid representations in DCR notation
is limited to timed relations and guards, however, since both annotations are using the same
visual variables (colour), it is possible that users find lower perceptual discriminability between
them.
          </p>
        </sec>
        <sec id="sec-2-3-9">
          <title>3.0.8. Graphic Economy</title>
          <p>By March 2022, DCR contains a vocabulary of thirty-two distinct visual elements. This
vocabulary is below PoN’s threshold for excessive vocabulary. DCR introduces a symbol deficit
to reduce some of the complexity in the graph (c.f. Section 3.0.1). No partition of semantic
complexity is evidenced. As mentioned in Section 3.0.2 shape is the sole information-carrying
variable in DCR and adding multiple visual variables to diferentiate concepts will increase
visual expressiveness, thus increasing perceptual discriminability.</p>
        </sec>
        <sec id="sec-2-3-10">
          <title>3.0.9. Cognitive Fit</title>
          <p>DCR presents a relation palette for novices and another for experts. Currently, there is no clear
segmentation between the two modes, and the relations ofered to novices add to the constraints
ofered to experts. When considering the representational medium, sketches of DCR models
in whiteboards renounce the use of colour variables. This change is compensated by adding
emphasis to the shape variable of constraints, for instance, by modifying the sizes of symbols in
constraints to facilitate perceptual discriminability.
4. Cognitive Efectiveness of DCR against SEQUAL</p>
        </sec>
        <sec id="sec-2-3-11">
          <title>4.0.1. Empirical Quality</title>
          <p>
            We observe a mixed application of SEQUAL guidelines: relations use a fixed palette, and events
and subprocesses have editable colours. Such liberty allows users to endow events with diferent
meanings than the intended one (e.g., events can be coloured as subprocesses and vice-versa).
The use of red-green colours to represent exclusion-inclusion constraints relates to SEQUAL
guidelines to the transparent colour coding. Furthermore, we observe that the size variable is
ifxed for events, and there is little use of typographical emphasis tools. Bold typefaces are used
in the description of roles. This diferentiation likely helps users separate ownership of events
from their content. Positioning of labels is used for guards and delays. However, positioning is
likely to be insuficient once relations link events in a vertical plane (c.f. relation →∙  in Fig
2), and, in some cases, perverse to the understanding of the graph (e.g., the colour label overlaps
with a coloured relation). With respect to event positioning, DCR does not ofer a guideline
on how to layout them, but it is likely that experts define their own layout scheme following
reading conventions [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ].
          </p>
          <p>Summary of the analysis
Partially satisfied (symbol deficit)
Partially satisfied</p>
          <p>Transparent: executed events, spatial enclosure in event collections.</p>
          <p>Translucent: colour choice for include/exclude relations.</p>
          <p>Opaque or perverse: complex events (subprocesses, nesting, transactional, data),
colour code in other relations.</p>
          <p>Partially satisfied: reduced accidental complexity but limited modularization
support.</p>
          <p>Partially satisfied: homogeneous integration is absent. Heterogeneous integration
is evidenced. Conceptual &amp; perceptual integration capabilities are absent.</p>
          <p>Partially satisfied. The shape is the only primary variable, but the colour variable
is bound in some cases.</p>
          <p>Partially satisfied (text annotation is not supported, hybrid coding is supported in
special relations).</p>
          <p>Partially satisfied. Visual vocabulary is not excessive and symbol deficit reduction
techniques are. A partition of semantic complexity is absent.</p>
          <p>Partially satisfied (novice/expert relation palette is suggested, but notation variants
are not discriminable).</p>
          <p>Partially satisfied. Manageable colour spectrum, but inconsistent colour usage.</p>
          <p>Colour choices are not recommended for colour vision deficiency users. Limited
use of typographical emphasis.</p>
          <p>Not satisfied.</p>
          <p>Dimension
Physics of Notations
Semiotic clarity
Perceptual
discriminability
Semantic
transparency
Complexity
management
Cognitive
integration
Visual
expressiveness
Dual coding
Graphic economy</p>
        </sec>
        <sec id="sec-2-3-12">
          <title>4.0.2. Social Quality</title>
          <p>
            Naming conventions aid users in identifying objects thanks to familiar forms (e.g., a linguistic
pattern “verb+object" signifies an activity performed in a process). We noticed that such a
pattern is not always used in DCR. Events are placeholders for both actions that participants
perform, and external sources of change (e.g., a deadline is reached, a message is received [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ]).
The diferentiation of controllable and uncontrollable events has been studied in literature [
            <xref ref-type="bibr" rid="ref24">24</xref>
            ]
and their graphical representations are diferent in other process modelling notations [
            <xref ref-type="bibr" rid="ref20">20</xref>
            ]. This
overload of the notation for two diferent concepts might likely afect users’ understandability.
The application of linguistic patterns will probably help if there is a clarification of what
constitutes an event in DCR. Regarding language documentation, the only source of documentation
comes from a company website4, and there is no standardised documentation. The volatility
and likely change of the sources inhibit the generation of a common understanding and limit
the creation of other tools that can support the notation.
          </p>
          <p>Nr. Improvement suggestion
1
2
3
4
5
6
7
8
9
10
11
12
13</p>
          <p>Relations between events should use more visual variables than shape and
colour.</p>
          <p>Other symbols diferent than arrows should be used in order to facilitate
discriminability and understanding of relations.</p>
          <p>Adding symbols to denote delays, timeouts and data guards will facilitate
their identification and diferentiation.</p>
          <p>Adding additional symbols to denote controllable and uncontrollable events
will support model understanding.</p>
          <p>A colour-neutral version of DCR graphs will support colour-blinded minorities
and relate to analogue versions of DCR models
Colours and shapes should not be reused to denote the diferent types of
relations.</p>
          <p>Diferent types of events (e.g., nesting, form, computation, subprocess) should
be identifiable via a change in the retinal variables
Events and event collections (nesting, and the diferent types of subprocesses)
should difer in the choices of the shape variable.</p>
          <p>Novice/expert modes need to be clearly separated, thus reducing the number
of constraints shown at each mode.</p>
          <p>High-level, non-executable representations of DCR graphs might help users
to navigate over complex process architectures.</p>
          <p>Adding the principle of cognitive integration for networks of graphs may help
in the contextualisation of process architectures
Users should be able to complement the graphical notation with their own
comments &amp; annotations.</p>
          <p>Provide a standardised reference model for the graphical notation.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5. Implications for Research and Practice</title>
      <p>
        Concerning dimensions
Perceptual discriminability, visual
expressiveness, empirical quality
Semantic transparency,
perceptual discriminability
Perceptual discriminability, semantic
transparency
Visual expressiveness, graphic
economy, social quality
Empirical quality, social quality
Perceptual discriminability
Perceptual discriminability
Perceptual discriminability
We suggest a roadmap for the improvement of DCR notation based on the analysis presented. It
suggests that notation extensions should make an efort in designing perceptually diferentiable
elements by novice users, using colours that are inclusive to visually impaired subjects. Moreover,
it suggests the importance of supporting novices in their learning process by allowing them to
annotate their models (dual coding), navigate complex models (complexity management) and
even provide model transformation techniques between expert and novice views (cognitive
ift). These suggestions, as well as the suggestions in Table 2, can be operationalised by tool
developers, or used as research hypotheses to be further tested via user studies. Moreover, the
analysis executed in perceptual discriminability, semantic transparency and social quality can
be transposed to the DECLARE process modelling notation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], as it uses similar symbols to
denote events and relations as DCR graphs.
      </p>
    </sec>
    <sec id="sec-4">
      <title>6. Related Work</title>
      <p>
        While previous works on the cognitive efects of imperative process modelling notations using
PoN and SEQUAL exist [
        <xref ref-type="bibr" rid="ref25 ref9">25, 9</xref>
        ], to the best of our knowledge, this paper presents the first
systematic analysis of a declarative process modelling notation using general cognitive efectiveness
frameworks. Other works use PoN partially. PoN has been used to study the semiotic clarity
of CMMN [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Figl et al [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] conduct empirical experiments on the semantic transparency of
DECLARE models. Their assessment suggesting that the representation of constraints as arrows
is semantically perverse to users is in line with our analysis in Sec. 3.0.3. PoN’s graphic economy,
cognitive integration, complexity management and semiotic clarity dimensions have been used
to drive novel graphical representations of DECLARE [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. With respect to SEQUAL, the role
of layout and edges in the understandability of imperative process models [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. Regarding
notations for declarative processes, Colombo Tossato et al. [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] proposed a visual notation for
norms, conditional and defeasible rules including a larger set of visual variables (texture and
shape). The representations of relations might be especially useful for DCR as the semantic
concepts are similar. Finally, Andaloussi et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] use personal construct psychology to define
a quality framework from experts in DCR graphs.
      </p>
    </sec>
    <sec id="sec-5">
      <title>7. Conclusion</title>
      <p>
        We provided a systematic analysis of the cognitive efects of DCR graphs in the context of two
general frameworks for the understandability of notations and provided a set of 13 guidelines that
could improve the cognitive efectiveness of the notation. We believe that the implementation of
such guidelines will benefit DCR graphs, as PoN principles have been demonstrated to positively
influence a notation’s perceived usefulness [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]. It is worth mentioning that even if PoN and
SEQUAL provide guidelines for evaluation, they gave no operational support [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. Even when
our paper describes the analysis metric used, a purely unbiased and objective observation is not
possible using the current setup unless users are involved. Moreover, some of the guidelines
may have counterarguments and further empirical analysis needs to be conducted. This is the
case for modularization: the application of modularization might require an additional mental
efort due to the need to switch between sub-processes and integrate information [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]. In future
work, we would like to complement this work with larger user studies and extend it to other
declarative notations, such as DECLARE and CMMN.
      </p>
      <p>Acknowledgements We would like to thank Amine Abbad Andaloussi and Barbara Weber
for their comments in earlier versions of this paper.</p>
    </sec>
    <sec id="sec-6">
      <title>A. DCR graphs metamodel</title>
      <p>Figure 4: DCR graphs metamodel</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lübke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Reijers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Weber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Weidlich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zugal</surname>
          </string-name>
          ,
          <article-title>Declarative versus imperative process modeling languages: The issue of understandability</article-title>
          , in: EMMSAD, Springer,
          <year>2009</year>
          , pp.
          <fpage>353</fpage>
          -
          <lpage>366</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Pesic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schonenberg</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. Van der Aalst</surname>
          </string-name>
          ,
          <article-title>Declare: Full support for loosely-structured processes</article-title>
          , in: EDOC, IEEE,
          <year>2007</year>
          , pp.
          <fpage>287</fpage>
          -
          <lpage>287</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>[3] OMG, Case management model and notation, version 1.1</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T. T.</given-names>
            <surname>Hildebrandt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Mukkamala</surname>
          </string-name>
          ,
          <article-title>Declarative event-based workflow as distributed dynamic condition response graphs</article-title>
          ,
          <source>arXiv preprint arXiv:1110.4161</source>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L. H.</given-names>
            <surname>Norgaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Andreasen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marquard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. S.</given-names>
            <surname>Larsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Jeppesen</surname>
          </string-name>
          ,
          <article-title>Declarative process models in government centric case and document management, in: BPM (Industry Track)</article-title>
          , volume
          <volume>1985</volume>
          <source>of CEUR, CEUR-WS.org</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>51</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Hildebrandt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Mukkamala</surname>
          </string-name>
          , T. Slaats,
          <article-title>Nested dynamic condition response graphs</article-title>
          ,
          <source>in: FSEN</source>
          , Springer,
          <year>2011</year>
          , pp.
          <fpage>343</fpage>
          -
          <lpage>350</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H. A.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Slaats</surname>
          </string-name>
          , T. T. Hildebrandt,
          <article-title>Business process compliance using reference models of law</article-title>
          , in: FASE, volume
          <volume>12076</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>378</fpage>
          -
          <lpage>399</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>D. L</surname>
          </string-name>
          . Moody, The “Physics” of Notations:
          <article-title>Toward a Scientific Basis for Constructing Visual Notations in Software Engineering</article-title>
          ,
          <source>IEEE TSEN 35</source>
          (
          <year>2009</year>
          )
          <fpage>24</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Krogstie</surname>
          </string-name>
          ,
          <article-title>Quality of business process models</article-title>
          ,
          <source>in: Quality in Business Process Modeling</source>
          , Springer,
          <year>2016</year>
          , pp.
          <fpage>53</fpage>
          -
          <lpage>102</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Andaloussi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Burattin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Slaats</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Weber</surname>
          </string-name>
          ,
          <article-title>Understanding quality in declarative process modeling through the mental models of experts</article-title>
          , in: BPM, volume
          <volume>12168</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>417</fpage>
          -
          <lpage>434</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Strømsted</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marquard</surname>
          </string-name>
          ,
          <article-title>Dynamic evaluation forms using declarative modeling</article-title>
          , in: BPM (Dissertation/Demos/Industry), volume
          <volume>2196</volume>
          <source>of CEUR, CEUR-WS.org</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>172</fpage>
          -
          <lpage>179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T. T.</given-names>
            <surname>Hildebrandt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Normann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marquard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Slaats</surname>
          </string-name>
          ,
          <article-title>Decision modelling in timed dynamic condition response graphs with data</article-title>
          ,
          <source>in: BPM Workshops</source>
          , Springer, Cham,
          <year>2022</year>
          , pp.
          <fpage>362</fpage>
          -
          <lpage>374</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Slaats</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Andaloussi</surname>
          </string-name>
          , T. T. Hildebrandt,
          <article-title>Chain of events: modular process models for the law</article-title>
          , in: iFM, Springer,
          <year>2020</year>
          , pp.
          <fpage>368</fpage>
          -
          <lpage>386</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D.</given-names>
            <surname>Basin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          , T. T.
          <article-title>Hildebrandt, In the nick of time: Proactive prevention of obligation violations</article-title>
          , in: CSF, IEEE,
          <year>2016</year>
          , pp.
          <fpage>120</fpage>
          -
          <lpage>134</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          , T. T. Hildebrandt, T. Slaats,
          <article-title>Replication, refinement &amp; reachability: complexity in dynamic condition-response graphs</article-title>
          ,
          <source>Acta Informatica</source>
          <volume>55</volume>
          (
          <year>2018</year>
          )
          <fpage>489</fpage>
          -
          <lpage>520</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sweller</surname>
          </string-name>
          ,
          <article-title>Cognitive load theory, in: Psychology of learning and motivation</article-title>
          , volume
          <volume>55</volume>
          ,
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          ,
          <year>2011</year>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>76</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <article-title>The magical number seven, plus or minus two: Some limits on our capacity for processing information</article-title>
          .,
          <source>Psychological review 63</source>
          (
          <year>1956</year>
          )
          <fpage>81</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A. v. Klopp</given-names>
            <surname>Lemon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. v. Klopp</given-names>
            <surname>Lemon</surname>
          </string-name>
          ,
          <article-title>Constraint matching for diagram design: Qualitative visual languages</article-title>
          ,
          <source>in: International Conference on Theory and Application of Diagrams</source>
          , Springer,
          <year>2000</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>88</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>O. I.</given-names>
            <surname>Lindland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sindre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Solvberg</surname>
          </string-name>
          ,
          <article-title>Understanding quality in conceptual modeling</article-title>
          ,
          <source>IEEE software 11</source>
          (
          <year>1994</year>
          )
          <fpage>42</fpage>
          -
          <lpage>49</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>OMG</surname>
          </string-name>
          ,
          <article-title>Business Process Model and Notation (BPMN), Version 2</article-title>
          .0,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>H. A.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Debois</surname>
          </string-name>
          , T. T. Hildebrandt,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marquard</surname>
          </string-name>
          ,
          <article-title>The process highlighter: From texts to declarative processes and back</article-title>
          , in: BPM (Dissertation/Demos/Industry), volume
          <volume>2196</volume>
          <source>of CEUR, CEUR-WS.org</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>66</fpage>
          -
          <lpage>70</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Reijers</surname>
          </string-name>
          , et al.,
          <source>Fundamentals of business process management</source>
          , volume
          <volume>1</volume>
          , Springer,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>B.</given-names>
            <surname>Aysolmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. N.</given-names>
            <surname>Cayhani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Reijers</surname>
          </string-name>
          ,
          <article-title>Narration as a technique to improve process model comprehension: Tell me what I cannot see</article-title>
          ,
          <source>in: CAiSE</source>
          , volume
          <volume>13295</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2022</year>
          , pp.
          <fpage>407</fpage>
          -
          <lpage>422</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>Broy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wirsing</surname>
          </string-name>
          ,
          <article-title>On the algebraic specification of nondeterministic programming languages</article-title>
          ,
          <source>in: CAAP</source>
          , volume
          <volume>112</volume>
          <source>of LNCS</source>
          , Springer, Berlin, Heidelberg,
          <year>1981</year>
          , pp.
          <fpage>162</fpage>
          -
          <lpage>179</lpage>
          . doi:
          <volume>10</volume>
          .1007/3-540-10828-9_
          <fpage>61</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>N.</given-names>
            <surname>Genon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Heymans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amyot</surname>
          </string-name>
          ,
          <article-title>Analysing the cognitive efectiveness of the bpmn 2.0 visual notation</article-title>
          ,
          <source>in: SLE</source>
          , Springer,
          <year>2010</year>
          , pp.
          <fpage>377</fpage>
          -
          <lpage>396</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>M. K. Bule</surname>
            , G. Polančič,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Huber</surname>
          </string-name>
          , G. Jošt,
          <article-title>Semiotic clarity of case management model and notation (CMMN)</article-title>
          ,
          <source>Computer Standards &amp; Interfaces</source>
          <volume>66</volume>
          (
          <year>2019</year>
          )
          <fpage>103354</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>K.</given-names>
            <surname>Figl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Reijers</surname>
          </string-name>
          ,
          <article-title>Do declarative process models help to reduce cognitive biases related to business rules?</article-title>
          ,
          <source>in: ER</source>
          , volume
          <volume>12400</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>119</fpage>
          -
          <lpage>133</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hanser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <article-title>A novel framework for visualizing declarative process models</article-title>
          ,
          <source>in: ZEUS</source>
          , volume
          <volume>1562</volume>
          <source>of CEUR, CEUR-WS.org</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>A.</given-names>
            <surname>Burattin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Neurauter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Weber</surname>
          </string-name>
          ,
          <article-title>Detection and quantification of flow consistency in business process models</article-title>
          ,
          <source>SoSym</source>
          <volume>17</volume>
          (
          <year>2018</year>
          )
          <fpage>633</fpage>
          -
          <lpage>654</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>S.</given-names>
            <surname>Colombo Tosatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Boella</surname>
          </string-name>
          , L. v. d. Torre,
          <string-name>
            <given-names>S.</given-names>
            <surname>Villata</surname>
          </string-name>
          ,
          <article-title>Visualizing normative systems: An abstract approach</article-title>
          , in: International Conference on Deontic Logic in Computer Science, Springer,
          <year>2012</year>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>30</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>K.</given-names>
            <surname>Figl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Derntl</surname>
          </string-name>
          ,
          <article-title>The impact of perceived cognitive efectiveness on perceived usefulness of visual conceptual modeling languages</article-title>
          ,
          <source>in: ER</source>
          , Springer,
          <year>2011</year>
          , pp.
          <fpage>78</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>D.</surname>
          </string-name>
          v. d. Linden,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zamansky</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Hadar</surname>
          </string-name>
          ,
          <article-title>How cognitively efective is a visual notation? on the inherent dificulty of operationalizing the physics of notations</article-title>
          , in: Enterprise,
          <source>Business-Process and Information Systems Modeling</source>
          , Springer,
          <year>2016</year>
          , pp.
          <fpage>448</fpage>
          -
          <lpage>462</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zugal</surname>
          </string-name>
          ,
          <article-title>Applying cognitive psychology for improving the creation, understanding and maintenance of business process models</article-title>
          ,
          <source>Ph.D. thesis</source>
          , University of Innsbruck,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>