<!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>Knowledge-intensive Processes: An Overview of Contemporary Approaches?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Claudio Di Ciccio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Marrella</string-name>
          <email>marrella@dis.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Russo</string-name>
          <email>arusso@dis.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Sapienza Universita di Roma</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <fpage>33</fpage>
      <lpage>47</lpage>
      <abstract>
        <p>Engineering of knowledge-intensive processes is far from being mastered. Processes are de ned knowledge-intensive when people/agents carry them out in a fair degree of \uncertainty", where the uncertainty depends on di erent factors, such as the high number of tasks to be represented, their unpredictable nature, or their dependency on the scenario. In the worst case, there is no pre-de ned view of the knowledge-intensive process, and tasks are mainly discovered as the process unfolds. In this work, starting from three di erent real scenarios, we present a critical comparative analysis of the existing approaches used for supporting knowledge-intensive processes, and we discuss some recent research techniques that may complement or extend the existing state of the art.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge-intensive Processes</kwd>
        <kwd>Process Management Systems</kwd>
        <kwd>Health Care</kwd>
        <kwd>Process Adaptation</kwd>
        <kwd>Process Mining</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Process management systems (PMSs) hold the promise of facilitating the
everyday operation of many enterprises and work environments. However, PMSs
remain especially useful in a limited range of applications where business
processes can be described with relative ease. Current modeling techniques are used
to codify processes that are completely predictable: all possible paths along the
process are well-understood, and the process participants never need to make a
decision about what to do next, since the work ow is completely determined by
their data entry or other attributes of the process. This kind of highly-structured
work includes mainly production and administrative processes. However, most
business functions involve collaborative features and unstructured processes that
do not have the same level of predictability as the routine structured work [
        <xref ref-type="bibr" rid="ref58">58</xref>
        ].
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] processes have been classi ed on the basis of their \degree of
structure". Traditional PMSs perform well with fully structured processes and
controlled interactions between participants. A major assumption is that such
processes, after having been modeled, can be repeatedly instantiated and executed
? This work has been partly supported by the SAPIENZA grant TESTMED and by
the EU Commission through the project SmartVortex
in a predictable and controlled manner. However, even for structured processes,
the combination and sequence of tasks may vary from instance to instance due
to changes in the execution context such as user preferences, or modi cations in
the environment such as exceptions and changes in the business rules. In such
cases (structured processes with ad hoc exceptions ), processes should be adapted
accordingly (e.g. by adding, removing or generating an alternative sequence of
activities). In general, structured processes can be described by an explicit and
accurate model. But in scenarios where processes are to a large extent unclear
and/or unstructured, process modeling cannot be completed prior to execution
(due to lack of domain knowledge a priori or to the complexity of task
combinations). Hence the classical axiom \ rst model, then execute" { valid for the
enactment of structured processes { fails. As processes are executed and
knowledge is acquired via experience, it is needed to go back to the process de nitions
and correct them according to work practices. This is the case of unstructured
processes with prede ned fragments, where processes cannot be anticipated, and
thus cannot be studied or modeled as a whole. Instead, what can be done is to
identify and study a set of individual activities, and then try to understand the
ways in which these activities can precede or follow each other. At the end of the
classi cation lies the category of unstructured processes, where it is impossible
to de ne a priori the exact steps to be taken in order to complete an assignment.
Since there is no pre-de ned view of the process, process steps are discovered
as the process scenario unfolds, and might involve decisions not based on some
\codi ed policy", but on the user expertise applied on the scenario at hand.
      </p>
      <p>
        The class of knowledge-intensive processes is transversal with respect to the
classi cation proposed in [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. In the literature, di erent de nitions have been
proposed about what does \knowledge-intensive" mean for a business process.
In [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] a process is de ned as knowledge intensive if its value can only be created
through the ful llment of the knowledge requirements of the process
participants, while Davenport recognizes the knowledge intensity by the diversity and
uncertainty of process input and output [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In our view, a knowledge-intensive
process is characterized by activities that can not be planned easily, may change
on the y and are driven by the contextual scenario that the process is embedded
in. The scenario dictates who should be involved and who is the right person
to execute a particular step, and the set of users involved may be not formally
de ned and be discovered as the process scenario unfolds. Collaborative
interactions among the users typically is a major part of such processes, and new
process steps might have to be de ned at run time on the basis of contextual
changes. Despite the popularity of commercial PMSs, there is still a lack of
maturity in managing such processes, i.e., a lack of a semantic associated to the
models or an easy way to reason about that semantic.
      </p>
      <p>In this paper, starting from three di erent real application scenarios, we
present a critical and comparative analysis of the existing approaches used for
supporting knowledge-intensive processes, and we discuss some recent research
techniques which may complement or extend the existing state of the art. The
rest of the paper is organized as follows. Section 2 discusses the role of
knowledgeintensive processes in the health-care domain, mainly focusing on how di erent
modeling approaches can contribute to the process representation and
execution. Section 3 discusses the use of knowledge-intensive processes for supporting
the work in highly dynamic scenarios, by focusing on the challenging aspect
of process adaptation. Section 4 traces the evolution of process mining, from
the beginnings up to the current open challenge of discovering exible models
for knowledge-intensive partially structured processes, along with the graphical
models proposed for presenting them to the user. Finally, Section 5 concludes
the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Modeling Approaches for Healthcare Processes</title>
      <p>
        Healthcare is widely recognized as one of the most promising, yet challenging,
domains for the adoption of process-oriented solutions able to support both
organizational and clinical processes [
        <xref ref-type="bibr" rid="ref10 ref30 ref31 ref46">10,31,46,30</xref>
        ]. Organizational processes, which also
include administrative tasks (patient admission/discharge, appointment
scheduling, etc.), are typically structured, stable and repetitive, and represent the ideal
setting for the application of traditional approaches for process automation and
improvement. On the other side, the knowledge-intensive nature and exibility
requirements of medical treatment processes [
        <xref ref-type="bibr" rid="ref3 ref37">3,37</xref>
        ] pose challenges that existing
process management approaches are not able to adequately handle. Although
BPM solutions can potentially support these processes, in practice their uptake
in healthcare is limited, mainly due to a generally perceived lack of
exibility [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]. Clinical decision making is highly knowledge-driven, as it depends on
medical knowledge and evidence, on case- and patient-speci c data, and on
clinicians' expertise and experience. Patient case management is mainly the result of
knowledge work, where clinicians act in response to relevant events and changes
in the clinical context on a per-case basis, according to so-called
diagnostictherapeutic cycles based on the interleaving between observation, reasoning and
action [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]. Clinical practices can not be captured by process models that require
a complete speci cation of activities and their control/data ow, with the risk
of constraining the clinicians and undermining the acceptance of proposed tools.
      </p>
      <p>
        Despite these characteristics, in the last years the medical community has
introduced Clinical Guidelines (CGs), in an attempt to improve care quality
and reduce costs. CGs are \systematically developed statements to assist
practitioner and patient decisions about appropriate health care for speci c clinical
circumstances"[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and act as blueprints that guide the care delivery process and
provide evidence-based recommendations. Consequently, many research groups
have focused on computer-interpretable clinical guidelines (CIGs) and di
erent languages have been proposed [
        <xref ref-type="bibr" rid="ref42 ref49 ref61">49,42,61</xref>
        ], which can be broadly classi ed as
rule-based (e.g., Arden Syntax), logic-based (e.g., PROforma), network-based
(e.g., EON) and work ow-based (e.g., Guide). Most of them follow a task-based
paradigm where modeling primitives for representing actions, decisions and
patient states are linked via scheduling and temporal constraints, often in a rigid
owchart-like structure, and many representation models are supported by
systems that allow the de nition and enactment of CGs [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. This rapid evolution
in medical informatics has occurred mainly independently of the advances in
the BPM community. However, the recent shift in the BPM domain towards
process exibility, adaptation (see Section 3) and evolution [
        <xref ref-type="bibr" rid="ref30 ref47">47,30</xref>
        ] has led to
reconsider the link with CIGs and investigate the bene ts coming from the
application of process-oriented approaches in the healthcare domain [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]. On the
one side, pattern-based analyses of CIG languages have shown that the
expressiveness of these models, although speci cally developed for the medical domain,
is comparable with (or even lower than) the expressiveness of process modeling
languages [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]. On the other side, emerging declarative constraint-based
approaches [
        <xref ref-type="bibr" rid="ref32 ref40">40,32</xref>
        ] have been investigated as a possible solution to achieve a high
degree of exibility, taking advantage of loosely speci ed process models. In this
direction, the combination of procedural and declarative models is under
investigation, in order to support healthcare processes with di erent degrees of
structuredness.
      </p>
      <p>
        After more than a decade of research activities, researchers and
practitioners agree on three main points: (i) clinical procedures, based on semi-structured
and unstructured decision making, can not be completely speci ed in advance
nor fully automated; (ii) deviations and variations during the care process (as
well as uncertainty and changes in the clinical context) represent the rule rather
than the exception; (iii) process- and activity-centric models can not adequately
represent and support clinical case management. One of the main limitations
of existing approaches is that they often underestimate the knowledge and data
dimension. As patient treatment is knowledge-driven, the focus should be not on
automating the decision making process, but rather on supporting the clinician
during this process, according to a \system suggests, user controls" approach [
        <xref ref-type="bibr" rid="ref62">62</xref>
        ]
that makes available the appropriate data and relevant knowledge when needed
or required. Any system intended to support CGs should allow for representing
and integrating at a semantic level evolving medical knowledge, patient-related
data (including conditions, medical history, prescribed treatments and
medications, etc.), and the existing (sometimes unpredictable) interactions between
patient conditions, treatments and medications. This focus on data and
knowledge is producing a shift from a process management approach to a more exible
case management approach, well understood by clinicians (although mostly in
the form of paper-based processes) but only partially investigated in the BPM
area [
        <xref ref-type="bibr" rid="ref60">60</xref>
        ]. Process support requires object-awareness in the form of a full
integration of processes with patient data models consisting of object types and object
relations [
        <xref ref-type="bibr" rid="ref30 ref5">30,5</xref>
        ]. Domain-relevant objects (such as medical orders, clinical and
lab reports, etc.), their attributes and their possible states need to be explicitly
represented, along with their inter-relations, so as to de ne a rich information
model. This data model enables the identi cation and de nition of the activities
that rely on the object-related information and act on it, producing changes on
attribute values, relations and object states. As a result, a tight integration
between data objects and process activities can be achieved. As object-awareness
requires a data-driven process modeling and execution approach, based on
object behavior and object interactions, process/activity-centric methodologies are
being replaced by data-centric models evolving over time [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In the context
of a CG, patient's clinical situation (referred to as patient state, scenario, or
context [
        <xref ref-type="bibr" rid="ref49">49</xref>
        ]) is central and represent the shared knowledge that drives the
decision making and evolves as a result of performed actions, made decisions and
collected data. Conditions de ned over patient state, along with temporal
constraints, are typically used as entry/exit points for a guideline [
        <xref ref-type="bibr" rid="ref61">61</xref>
        ] and as
eligibility criteria for speci c actions [
        <xref ref-type="bibr" rid="ref49">49</xref>
        ]. During the collaboration-based patient
management activities, clinicians have to react to internal (e.g., a change in
patient's state) and external (e.g., availability of lab test results) events, that
can occur in any sequence. Moreover, it is often not possible to predetermine
which activities have to be executed and in which order when an event occurs:
according to the diagnostic-therapeutic cycles mentioned before, the clinician
rst assesses and evaluate the situation and then acts or plans the actions to
be performed. This suggests an interleaving and overlapping of modeling and
execution, where the process is \created at the time it is executed". Any
modeling and execution approach for supporting this view has to consider that the
clinician should be guided by what can be done and not restricted by what has
to be done [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ]. Although the path to be followed can be initially unclear and is
gradually determined by clinician decisions, the care process evolves through a
series of intermediate goals or milestones to be achieved (e.g., bring a parameter
back to a normal level) that can again be expressed as conditions or constraints
over patient state.
      </p>
      <p>
        Given the above scenario, a promising and emerging approach for
modeling CGs and supporting their execution and management is the artifact-centric
paradigm, which considers data and knowledge as an integral part of business
processes [
        <xref ref-type="bibr" rid="ref51">51</xref>
        ]. It is based on the concept of business artifacts as an abstraction
for business-relevant entities and data that evolve according to a lifecycle and
drive the activities in a business setting. Activities are de ned in the context
of interrelated artifacts and become enabled as the result of triggering events
(internal or external) constrained by conditions de ned and evaluated over the
artifacts. Events and conditions over artifacts can also be used to set speci c
goals and evaluate the progress towards their achievement. The scheduling of
actions is thus event- and data-driven, rather than induced by direct control
ow dependencies. Under this perspective, it emerges a clear correspondence
between artifact-centric concepts and clinical case management, in particular if
considering the Guard-Stage-Milestone (GSM) meta-model [
        <xref ref-type="bibr" rid="ref51">51</xref>
        ] as a
representative example of the artifact-based paradigm. GSM builds on the concepts of
information model and lifecycle model, where the latter includes milestones to
be achieved, hierarchically organized stages as clusters of possible activities to
be performed to achieve milestones, and guards, timed events and conditions
that control the stages and determine milestones' achievement. The patient and
his/her state, a diagnostic test, a treatment course can all be considered as
artifact types and represented by an information model that evolves according
to a lifecycle and captures all relevant data and relations (e.g., as a relational
model or domain ontology). CGs could be seen as progressing through a set
of stages, where each performed action, made decision or event occurrence is
driven by (eligibility criteria mentioned before) and has an impact on patient
state, as re ected in the underlying information model. The data-driven nature
of the model facilitates the integration between process control knowledge and
the patient-related and medical knowledge; in addition, the distinction between
data attributes and status attributes can directly support an integrated and
explicit representation of both patient and execution states, not provided by all
CIG models [
        <xref ref-type="bibr" rid="ref49 ref61">61,49</xref>
        ]. Although artifact-centric models can open the way for a
new generation of exible and adaptive case management systems in healthcare,
further investigation is needed to understand the contribution that these
models can bring in solving well-known problems for CIGs; among them: (i) how
to reconcile the decision-action nature of CGs with a declarative modeling
approach than can be used and understood by clinicians and is able to represent
the evidence-based knowledge contained in the CGs; (ii) how to de ne an
information model that is able to capture all clinically relevant data and takes into
account existing standards, models, and ontologies used in Electronic Medical
Records (EMRs) for patient and medical data; (iii) to what extent clinical events
and medical knowledge can be represented and encoded by rules and conditions;
(iv) how can an artifact-centric model address the problems of guideline
acquisition, veri cation, testing, tracing and evolution, and how to turn or customize
abstract models in executable models that take into account additional
information, such as resource availability, roles and local services, in a collaborative
multi-user environment.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Process Adaptation in Highly Dynamic Scenarios</title>
      <p>
        A recent open research question in the BPM eld concerns how to tackle
scenarios characterized by being very dynamic and subject to higher frequency of
unexpected contingencies than classical scenarios, e.g., scenarios for emergency
management. There, a PMS can be used to coordinate the activities of rst
responders on the eld (e.g., reach a location, evacuate people from collapsed
buildings, extinguish a re, etc.). The use of processes for supporting the work
in highly dynamic contexts has become a reality, thanks also to the growing use
of mobile devices in everyday life, which o er a simple way for picking up and
executing tasks. These kinds of processes are also named dynamic processes. A
dynamic process usually includes a wide range of knowledge-intensive tasks; as
the process proceeds, the sequence of tasks depends so much upon the speci cs
of the context (for example, which resources are available and what particular
options exist at that time), and often it is unpredictable the way in how it
unfolds. This is due to the high number of tasks to be represented and to their
unpredictable nature, or to a di culty to model the whole knowledge of the
domain of interest at design time. If we refer again to the classi cation shown
in [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ], dynamic processes can be classi ed between structured processes with
ad hoc exceptions and unstructured processes with prede ned fragments.
      </p>
      <p>
        Research e orts in this eld try to enhance the ability of dynamic processes
and their support environments to modify their behavior in order to deal with
contextual changes and exceptions that may occur in the operating environment
during process enactment and execution. On the one hand, existing PMSs like
YAWL [
        <xref ref-type="bibr" rid="ref50">50</xref>
        ] provide the support for the handling of expected exceptions. The
process schemas are designed in order to cope with potential exceptions, i.e.,
for each kind of exception that is envisioned to occur, a speci c contingency
process (a.k.a. exception handler or compensation ow) is de ned. On the other
hand, adaptive PMSs like ADEPT2 [
        <xref ref-type="bibr" rid="ref65">65</xref>
        ] support the handling of unanticipated
exceptions, by enabling di erent kinds of ad-hoc deviations from the pre-modeled
process instance at run-time, according to the structural process change patterns
de ned in [
        <xref ref-type="bibr" rid="ref64">64</xref>
        ].
      </p>
      <p>However, traditional approaches that try to anticipate how the work will
happen by solving each problem at design time, as well as approaches that allow
to manually change the process structure at run time, are often ine ective or
not applicable in rapidly evolving contexts. The design-time speci cation of all
possible compensation actions requires an extensive manual e ort for the
process designer, that has to anticipate all potential problems and ways to overcome
them in advance, in an attempt to deal with the unpredictable nature of this
kind of processes. Moreover, the designer often lacks the needed knowledge to
model all the possible contingencies, or this knowledge can become obsolete as
process instances are executed and evolve, by making useless his/her initial
effort. In general, for a dynamic process there is not a clear, anticipated correlation
between a change in the context and corresponding process changes, since the
process may be di erent every time it runs and the recovery procedure strictly
depends on the actual contextual information. For the same reason, it is also
di cult to manually de ne an ad-hoc recovery procedure at run-time, as the
correctness of the process execution is highly constrained by the values (or
combination of values) of contextual data. Dealing with dynamic processes require
that PMSs provide intelligent failure handling mechanisms that, starting from
the original process model, are able to adapt process instances without explicitly
de ning at design time all the handlers/policies to recover from exceptions and
without the intervention of domain experts.</p>
      <p>
        Recently, some techniques from the eld of arti cial intelligence (AI) have been
applied to process management, with the purpose of improving the degree of
automatic adaptation of dynamic processes. In [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], the authors present a concept
for dynamic and automated work ow re-planning that allows recovering from
task failures. To handle the situation of a partially executed work ow, a
multistep procedure is proposed that includes the termination of failed activities, the
sound suspension of the work ow, the generation of a new complete process
definition and the adequate process resumption. In [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], the authors take a much
broader view of the problem of adaptive work ow systems, and show that there
is a strong mapping between the requirements of such systems and the
capabilities o ered by AI techniques. In particular, the work describes how planning can
be interleaved with process execution and plan re nement, and investigates plan
patching and plan repair as means to enhance exibility and responsiveness.
A new life cycle for work ow management based on the continuous interplay
between learning and planning is proposed in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. The approach is based on
learning business activities as planning operators and feeding them to a planner
that generates the process model. The main result is that it is possible to
produce fully accurate process models even though the activities (i.e., the operators)
may not be accurately described. The approach presented in [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ] highlights the
improvements that a legacy work ow application can gain by incorporating
planning techniques into its day-to-day operation. The use of contingency planning
to deal with uncertainty (instead of replanning) increases system exibility, but
it does su er from a number of problems. Speci cally, contingency planning is
often highly time-consuming and does not guarantee a correct execution under
all possible circumstances. Planning techniques are also used in [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] to de ne
a self-healing approach for handling exceptions in service-based processes and
repairing faulty activities with a model-based approach. During the process
execution, when an exception occurs, a new repair plan is generated by taking into
account constraints posed by the process structure and by applying or deleting
actions taken from a given generic repair plan, de ned manually at design time.
      </p>
      <p>
        An interesting approach for dealing with exceptional changes has been
proposed in [
        <xref ref-type="bibr" rid="ref13 ref34">13,34</xref>
        ]. Here, it is presented SmartPM (Smart Process Management),
a model and a proof-of-concept PMS featuring a set of techniques providing
support for automatic adaptation of processes. In SmartPM, a process model is
de ned as a set of n task de nitions, where each task ti can be considered as a
single step that consumes input data and produces output data. Data are
represented through some process variables whose de nition depends strictly on the
speci c process domain of interest. The model allows to de ne logical constraints
based on process variables through a set F of predicates fj . Such predicates can
be used to constrain the task assignment (in terms of task preconditions ), to
assess the outcome of a task (in terms of task e ects) and as guards into the
expressions at decision points (e.g., for cycles or conditional statements). Choosing
the predicates that are used to describe each activity falls into the general
problem of knowledge representation. To this end, the environment, services and tasks
are grounded in domain theories described in Situation Calculus [
        <xref ref-type="bibr" rid="ref48">48</xref>
        ]. Situation
Calculus is speci cally designed for representing dynamically changing worlds in
which all changes are the result of the tasks' execution. Processes are represented
as IndiGolog programs. IndiGolog [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] allows for the de nition of programs
with cycles, concurrency, conditional branching and interrupts that rely on
program steps that are actions of some domain theory expressed in Situation
Calculus. The dynamic world of SmartPM is modeled as progressing through a series
of situations. Each situation is the result of various tasks being performed so far.
Predicates may be thought of as \properties" of the world whose values may vary
across situations. SmartPM provides mechanisms for adapting process schemas
that require no pre-de ned handlers. Speci cally, adaptation in SmartPM can
be seen as reducing the gap between the expected reality, the (idealized) model
of reality that is used by the PMS to reason, and the physical reality, the real
world with the actual values of conditions and outcomes. The physical reality
s re ects the concept of \now", i.e., what is happening in the real environment
whilst the process is under execution. In general, a task ti can only be performed
in a given physical reality s if and only if that reality satis es the preconditions
P rei of that task. Moreover, each task has also a set of e ects Ef fi that change
the current physical reality s into a new physical reality s+1. At execution
time, the process can be easily invalidated because of task failures or since the
environment may change due to some external event. For this purpose, the
concept of expected reality s is given. A recovery procedure is needed if the two
realities are di erent from each other. An execution monitor is responsible for
detecting whether the gap between the expected and physical realities is such
that the original process 0 cannot progress its execution. In that case, the PMS
has to nd a recovery process h that repairs 0 and removes the gap between the
two kinds of reality. Currently, the adaptation algorithm deployed in SmartPM
synthesizes a linear process h (i.e., a process consisting of a sequence of tasks)
and inserts it at a given point of the original process - speci cally, that point of
the process where the deviation was rst noted. This means that such technique
is able to automatically recover from exceptions without de ning explicitly any
recovery policy.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Mining</title>
      <p>
        Process Mining [
        <xref ref-type="bibr" rid="ref54">54</xref>
        ], also referred to as Work ow Mining [
        <xref ref-type="bibr" rid="ref53">53</xref>
        ], is the set of
techniques that allow the extraction of process descriptions, stemming from a set of
recorded executions. Throughout this Section, we will investigate the techniques
adopted, along with the notations used to display the results, i.e., the mined
processes. To date, ProM [
        <xref ref-type="bibr" rid="ref55">55</xref>
        ] is one of the most used plug-in based software
environment for implementing work ow mining techniques. The idea to apply
process mining in the context of work ow management systems was introduced in
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. There, processes were modelled as directed graphs where vertices represented
individual activities and edges stood for dependencies between them. Cook and
Wolf, at the same time, investigated similar issues in the context of software
engineering processes. In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] they described three methods for process discovery:
(i) neural network-based, (ii) purely algorithmic, (iii) adopting a
Markovian approach. The authors considered the latter two as the most promising.
Although, the results presented in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] were limited to sequential behavior only.
The nowadays mainstream process mining algorithms and management tools
model processes with a graphical syntax derived from a subset of Petri Nets,
i.e., Work ow Nets (WfN [
        <xref ref-type="bibr" rid="ref53">53</xref>
        ]), explicitly designed to represent the control- ow
dimension of a work ow. See [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ] for a history of Petri nets and an extensive
bibliography. From [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] onwards many techniques have been proposed, in order to
address speci c issues: pure algorithmic (e.g., algorithm [
        <xref ref-type="bibr" rid="ref59">59</xref>
        ] and its evolution
++ [
        <xref ref-type="bibr" rid="ref67">67</xref>
        ]), heuristic (e.g., [
        <xref ref-type="bibr" rid="ref66">66</xref>
        ]), genetic (e.g., [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ]). Heuristic and genetic
algorithms were introduced to cope with noise, that the pure algorithmic techniques
were not able to manage. Whereas algorithmic processes rely on footprints of
traces (i.e., tables reporting whether events appeared before or afterwards, if
decidable) to determine the work ow net that could have generated them, heuristic
approaches build a representation similar to causal nets, taking frequencies of
events and sequences into account when constructing the process model, in
order to ignore infrequent paths. Genetic process mining adopts an evolutionary
approach to the discovery and di ers from the other two in that its computation
evolves in a non-deterministic way: the nal output, indeed, is the result of a
simulation of a process of natural selection and evolutionary reproduction of the
procedures used to determine the nal outcome. A very smart extension to the
previous research was achieved by the two-steps algorithm proposed in [
        <xref ref-type="bibr" rid="ref52">52</xref>
        ].
Differently from previous works, in which the proposed approaches provide a single
process mining step, it splitted the computation in two phases: the rst built
a Transition System that represents the process behavior and the tasks causal
dependencies; the second made use of the state-based \theory of regions" [
        <xref ref-type="bibr" rid="ref15 ref9">9,15</xref>
        ]
to construct a Petri Net bisimilar to the Transition System. The rst phase was
made \tunable", so that it could be either more strictly adhering or more
permissive to the analyzed log traces behavior, i.e., the expert could determine a
balance between \over tting" and \under tting". Indeed, past execution traces
are not the whole universe of possible ones that may run: hence, the extracted
process model should be valid for future unpredictable cases, on one hand,
nevertheless checking whether the latter actually adhere to the common behavior,
on the other hand. This issue reveals to be particularly relevant in the eld of
knowledge-intensive processes.
      </p>
      <p>
        To date, the majority of research relating to processes coped with structured
business processes. [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] discusses about a particular class of knowledge-intensive
processes, named \artful business processes"; they are typically carried out by
those people whose work is mental rather than physical (managers, professors,
researchers, etc.), the so called \knowledge workers" ([
        <xref ref-type="bibr" rid="ref63">63</xref>
        ]). With their skills,
experience and knowledge, they are used to perform di cult tasks which require
complex, rapid decisions among multiple possible strategies, in order to ful ll
speci c goals. In contrast to business processes that are formal and standardized,
informal processes are not even written down, often, let alone de ned formally,
and can vary from person to person even when those involved are pursuing the
same objective. Knowledge workers create informal processes \on the y" to
cope with many of the situations which arise in their daily work. While informal
processes are frequently repeated, because they are not written down, they are
not exactly reproducible, even by their originators, nor can they be easily shared.
[
        <xref ref-type="bibr" rid="ref63">63</xref>
        ] described the \ACTIVE" EU collaborative project, coordinated by British
Telecom. Such project addressed the need for greater knowledge worker
productivity by providing more e ective and e cient tools. Among the main objectives,
it aimed at helping users to share and reuse informal processes, even by learning
those processes from the user's behavior. Basing on the work of [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and [
        <xref ref-type="bibr" rid="ref56">56</xref>
        ],
[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] investigated the challenge of mining these processes out of semi-structured
texts, i.e., the email conversations exchanged among knowledge workers, through
the interplay of text mining, object matching and process mining techniques. It
provided an architectural overview of the application (named MailOfMine) able
to ful ll the objective.
      </p>
      <p>
        The need for exibility in the de nition of some types of process, such as artful
business processes, leads to an alternative to the classical \imperative" approach:
the \declarative". Rather than using a procedural language for expressing the
allowed sequences of activities, it is based on the description of work ows through
the usage of constraints: the idea is that every task can be performed, except
what does not respect them. [
        <xref ref-type="bibr" rid="ref58">58</xref>
        ] showed how the declarative approach can help in
obtaining a fair trade-o between exibility in managing collaborative processes
and support in controlling and assisting the enactment of work ows. DecSerFlow
[
        <xref ref-type="bibr" rid="ref57">57</xref>
        ] and ConDec [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ], now under the name of Declare [
        <xref ref-type="bibr" rid="ref44">44</xref>
        ], de ne such constraints
as formulations in Linear Temporal Logic. [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] outlines an algorithm for mining
Declare processes, integrated in ProM (namely, Declare Miner). The tool is based
on the translation of Declare constraints into automata, and works in conjunction
with the optimization techniques described in [
        <xref ref-type="bibr" rid="ref68">68</xref>
        ]. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] describes the usage of
inductive logic programming techniques to mine models expressed as a SCIFF
theory. SCIFF theory is thus translated into the ConDec notation [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ]. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] di ers
from both [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] in that it does not directly verify the candidate constraints
over the whole set of traces in input. It prepares an ad-hoc knowledge base of
its own, instead, which speci c queries are further submitted to. The model is
determined on the base of the result of such queries. MINERful, proposed in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ],
exploits this two-steps technique too, in order to improve the e ciency of the
mining procedure. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] proves the complexity of the algorithm to be polynomial
w.r.t. the size of both the alphabet of constraints and the input traces. Di erently
from [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], it is independent of the formalism adopted for representing
constraints.
      </p>
      <p>
        Declare provides a graphical model for representing declarative processes,
useful to depict the constraints that hold between activities as a graph where
nodes are activities and arcs are constraints among them. [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] and [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] presented
a di erent approach to the graphical modelling. The former describes an
eventbased model, namely DCRGraph, showing the current state of the work ow at
run-time, through the listing of tasks that can (either optionally or mandatorily)
or can not be executed at the moment. A section describing the mapping of that
notation to Buchi Automata is provided as well. The latter provides multiple
graphical syntaxes, respectively depicting the process from two viewpoints: (i)
global, i.e., focused on the representation of constraints between tasks,
represented all together in a single graph and (ii) local i.e., focused instead on the
constraints directly related to one single activity at a time. The rst is then
divided into a base and an extended version, in order to respectively depict less
or more details about the nature of constraints that hold in the process {
following the so called \map metaphor" [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. The second is also twofold. The static
view shows the constraints a ecting an activity, which is put on the origin of a
cartesian-like diagram. There, the implication and the temporal succession are
aligned on orthogonal axes. The tasks involved in constraints related to the
activity under analysis are put on di erent coordinates accordingly. In the dynamic
view, the graph evolves as new tasks are executed. Starting from the initial, the
enacted task is chained down to the previous. On the basis of the execution
trace, the consequent next tasks are shown below the chain, in compliance with
the constraints that hold at the moment.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this work, we provided a critical and comparative analysis of the existing
approaches used for supporting knowledge-intensive processes, and we showed
some recent research techniques that may complement or extend the existing
state of the art to this end.</p>
      <p>In the health care domain, several challenges still need to be addressed and
an interdisciplinary research e ort is required. In this direction, the existing
gap between the general evidence-based knowledge contained in CGs and the
knowledge and information required to apply them to speci c patients in local
healthcare organizational contexts needs further investigation. Similarly,
modeling approaches should allow to capture all \knowledge layers" and their possible
interactions, including the procedural knowledge contained in CGs, the
declarative knowledge representing domain- or site-speci c constraints and properties,
and clinicians' basic medical knowledge.</p>
      <p>In highly dynamic environments, commercial PMSs are not able to deal with
knowledge-intensive processes su ciently, due to the static and only implicitly
de ned meta models of those systems. Basically, a dynamic process is largely
dependent on the scenario at hand, and the result of process modeling is often
a static plan of actions, which is di cult to adapt to changing procedures or to
di erent business goals. In order to devise intelligent failure handling mechanisms
for dynamic processes there is the need to de ne enriched work ow models,
possibly with a declarative speci cation of process tasks, i.e., comprising the
speci cation of input/output artefacts and task preconditions and e ects. In
general, the use of AI techniques for adapting dynamic processes seems very
promising.</p>
      <p>
        In the area of process mining, the declarative model proves to be very e ective
in allowing exibility required by knowledge-intensive processes. Although, it has
to be veri ed with people involved in those processes. E.g., the graphical notation
proposed in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] has to be implemented and its readability tested with real actors
of those processes. A graphical notation representing the level of severity of a
constraint in the process still misses. In the area of declarative work ow mining,
it might be useful to determine the tightness of the discovered constraints on
the basis of the frequency with which a constraint did not hold in the past.
Moreover, a study on the impact of noise in such analysis could be done.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Agrawal</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gunopulos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leymann</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Mining process models from work ow logs</article-title>
          .
          <source>In: EDBT'98</source>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Alberti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chesani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gavanelli</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lamma</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mello</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torroni</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Veri - able agent interaction in abductive logic programming: The sci framework</article-title>
          .
          <source>ACM Trans. Comput. Log</source>
          .
          <volume>9</volume>
          (
          <issue>4</issue>
          ) (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ammon</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Ho mann, D.,
          <string-name>
            <surname>Jakob</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finkeissen</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Detschew</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wetter</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Management of Knowledge-Intensive Healthcare Processes on the Example of General Medical Documentation</article-title>
          . In: BPM Workshops (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Chesani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lamma</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mello</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montali</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riguzzi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Storari</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Exploiting inductive logic programming techniques for declarative process mining</article-title>
          .
          <source>T. Petri Nets and Other Models of Concurrency</source>
          <volume>2</volume>
          ,
          <issue>278</issue>
          {
          <fpage>295</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chiao</surname>
            ,
            <given-names>C.M.</given-names>
          </string-name>
          , Kunzle, V.,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Towards Object-aware Process Support in Healthcare Information Systems</article-title>
          .
          <source>In: eTELEMED</source>
          <year>2012</year>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>W.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carvalho</surname>
          </string-name>
          , V.R., Mitchell, T.M.:
          <article-title>Learning to classify email into \speech acts"</article-title>
          .
          <source>In: EMNLP</source>
          . pp.
          <volume>309</volume>
          {
          <fpage>316</fpage>
          .
          <string-name>
            <surname>ACL</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Combi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gambini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Migliorini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Posenato</surname>
          </string-name>
          , R.:
          <article-title>Modelling temporal, datacentric medical processes</article-title>
          .
          <source>In: ACM SIGHIT IHI</source>
          <year>2012</year>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Cook</surname>
            ,
            <given-names>J.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolf</surname>
            ,
            <given-names>A.L.</given-names>
          </string-name>
          :
          <article-title>Discovering models of software processes from event-based data</article-title>
          .
          <source>ACM Trans. Softw. Eng. Methodol</source>
          .
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <volume>215</volume>
          {
          <fpage>249</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Cortadella</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kishinevsky</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lavagno</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yakovlev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Deriving petri nets from nite transition systems</article-title>
          .
          <source>IEEE Trans. on Computers</source>
          <volume>47</volume>
          (
          <issue>8</issue>
          ),
          <volume>859</volume>
          {
          <fpage>882</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuhn</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Clinical Work ows - The Killer Application for Process-oriented Information Systems</article-title>
          ? In: BIS'
          <volume>00</volume>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Davenport</surname>
          </string-name>
          , T.H.:
          <article-title>Improving knowledge work processes</article-title>
          .
          <source>In: Sloan Management Review</source>
          , vol.
          <volume>37</volume>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>De Giacomo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lesperance</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levesque</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sardina</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>IndiGolog: A HighLevel Programming Language for Embedded Reasoning Agents</article-title>
          .
          <source>In: Multi-Agent Prog.: Languages, Platforms and Applications</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. de Leoni,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Marrella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mecella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Sardina</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>SmartPM { Featuring Automatic Adaptation to Unplanned Exceptions</article-title>
          .
          <source>Tech. rep., Sapienza Universita di Roma</source>
          (
          <year>2011</year>
          ), http://ojs.uniroma1.it/index.php/DIS_TechnicalReports/ article/view/9221/9141
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. de Leoni, M.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ter Hofstede</surname>
            ,
            <given-names>A.H.M.</given-names>
          </string-name>
          :
          <article-title>Visual support for work assignment in process-aware information systems</article-title>
          . In: BPM'
          <volume>08</volume>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Desel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reisig</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>The synthesis problem of petri nets</article-title>
          .
          <source>Acta Informatica</source>
          <volume>33</volume>
          ,
          <issue>297</issue>
          {
          <fpage>315</fpage>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>Di</given-names>
            <surname>Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Catarci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Mecella</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Representing and visualizing mined artful processes in MailOfMine</article-title>
          . In:
          <string-name>
            <surname>HCI-KDD</surname>
          </string-name>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>Di</given-names>
            <surname>Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Mecella</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.:</surname>
          </string-name>
          <article-title>MINERful, a mining algorithm for declarative process constraints in MailOfMine</article-title>
          .
          <source>Tech. rep., Sapienza Universita di Roma</source>
          (
          <year>2012</year>
          ), http: //ojs.uniroma1.it/index.php/DIS_TechnicalReports/issue/view/416
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>Di</given-names>
            <surname>Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Mecella</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.:</surname>
          </string-name>
          <article-title>Mining constraints for artful processes</article-title>
          .
          <source>In: BIS'12</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>Di</given-names>
            <surname>Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Mecella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Scannapieco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Zardetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Catarci</surname>
          </string-name>
          , T.:
          <article-title>MailOfMine - analyzing mail messages for mining artful collaborative processes</article-title>
          .
          <source>In: SIMPDA'11</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Ferreira</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferreira</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>An Integrated Life Cycle for Work ow Management Based on Learning and Planning</article-title>
          .
          <source>Int. J. Coop. Inf. Syst</source>
          .
          <volume>15</volume>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Field</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lohr</surname>
            ,
            <given-names>K.N.:</given-names>
          </string-name>
          <article-title>Clinical Practice Guidelines: Directions for a New Program</article-title>
          . Institute of Medicine, Washington, DC (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fugini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mussi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pernici</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tagni</surname>
          </string-name>
          , G.:
          <article-title>Exception Handling for Repair in Service-Based Processes</article-title>
          .
          <source>IEEE Trans. on Soft. Eng</source>
          .
          <volume>36</volume>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Gajewski</surname>
          </string-name>
          , M., Meyer, H.,
          <string-name>
            <surname>Momotko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuschel</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Dynamic Failure Recovery of Generated Work ows</article-title>
          .
          <source>In: DEXA'05</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Gronau</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Management of knowledge intensive business processes</article-title>
          .
          <source>In: BPM'04</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.,
          <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'10</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Hill</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kogan</surname>
            ,
            <given-names>S.L.</given-names>
          </string-name>
          :
          <article-title>Beyond predictable work ows: Enhancing productivity in artful business processes</article-title>
          .
          <source>IBM Syst. J</source>
          .
          <volume>45</volume>
          (
          <issue>4</issue>
          ),
          <volume>663</volume>
          {
          <fpage>682</fpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Isern</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Computer-based execution of clinical guidelines: a review</article-title>
          .
          <source>Int. J. of Medical Informatics</source>
          <volume>77</volume>
          (
          <issue>12</issue>
          ) (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Jarvis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stader</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macintosh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>du Mont</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chung</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Exploiting AI Technologies to Realise Adaptive Work ow Systems</article-title>
          .
          <source>AAAI Workshop on Agent-Based Systems in the Business Context</source>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Kemsley</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The Changing Nature of Work: From Structured to Unstructured, from Controlled to Social</article-title>
          . In: BPM'
          <volume>11</volume>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Lenz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peleg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Healthcare Process Support: Achievements, Challenges, Current Research. IJKBO (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Lenz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>IT support for healthcare processes - Premises, challenges, perspectives</article-title>
          .
          <source>Data &amp; Know. Eng</source>
          .
          <volume>61</volume>
          (
          <issue>1</issue>
          ) (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Lyng</surname>
            ,
            <given-names>K.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hildebrandt</surname>
          </string-name>
          , T.T.,
          <string-name>
            <surname>Mukkamala</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          :
          <article-title>From Paper Based Clinical Practice Guidelines to Declarative Work ow Management</article-title>
          . In: BPM (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mooij</surname>
            , A.J., van der Aalst,
            <given-names>W.M.P.:</given-names>
          </string-name>
          <article-title>User-guided discovery of declarative process models</article-title>
          .
          <source>In: CIDM</source>
          . pp.
          <volume>192</volume>
          {
          <fpage>199</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Marrella</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mecella</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Continuous Planning for Solving Business Process Adaptivity</article-title>
          . In: BPMDS'
          <volume>11</volume>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>de Man</surname>
          </string-name>
          , H.:
          <article-title>Case Management: A Review of Modeling Approaches. BPTrends, www</article-title>
          .bptrends.com (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Mans</surname>
            , R.S., van der Aalst,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>N.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bakker</surname>
            ,
            <given-names>P.J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moleman</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          :
          <article-title>Process-Aware Information System Development for the Healthcare Domain - Consistency, Reliability, and E ectiveness</article-title>
          .
          <source>In: BPM Workshops</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Marjanovic</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Improving Knowledge-Intensive Health Care Processes beyond Efciency</article-title>
          . In: ICIS'
          <volume>11</volume>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Medeiros</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weijters</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aalst</surname>
            ,
            <given-names>W.M.:</given-names>
          </string-name>
          <article-title>Genetic process mining: an experimental evaluation</article-title>
          .
          <source>Data Min. Knowl. Discov</source>
          .
          <volume>14</volume>
          (
          <issue>2</issue>
          ),
          <volume>245</volume>
          {
          <fpage>304</fpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Mulyar</surname>
          </string-name>
          , N.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peleg</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A Pattern-based Analysis of Clinical Computer-interpretable Guideline Modeling Languages</article-title>
          .
          <source>JAMIA</source>
          <volume>14</volume>
          (
          <issue>6</issue>
          ) (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Mulyar</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pesic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peleg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Declarative and procedural approaches for modelling clinical guidelines: addressing exibility issues</article-title>
          .
          <source>In: BPM'07</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Murata</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Petri nets: Properties, analysis and applications</article-title>
          .
          <source>Proceedings of the IEEE</source>
          <volume>77</volume>
          (
          <issue>4</issue>
          ),
          <volume>541</volume>
          {
          <fpage>580</fpage>
          (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Peleg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>e</year>
          .a.:
          <article-title>Comparing Computer-Interpretable Guideline Models: A Case-Study Approach</article-title>
          .
          <source>JAMIA</source>
          <volume>10</volume>
          (
          <issue>1</issue>
          ) (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Pesic</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.:</given-names>
          </string-name>
          <article-title>A declarative approach for exible business processes management</article-title>
          .
          <source>In: BPM Workshops</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Pesic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schonenberg</surname>
            , H., van der Aalst,
            <given-names>W.M.P.</given-names>
          </string-name>
          : Declare:
          <article-title>Full support for loosely-structured processes</article-title>
          .
          <source>In: EDOC</source>
          . pp.
          <volume>287</volume>
          {
          <issue>300</issue>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          45.
          <string-name>
            <surname>R-Moreno</surname>
            ,
            <given-names>M.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borrajo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cesta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oddi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Integrating planning and scheduling in work ow domains</article-title>
          .
          <source>Expert Syst. with App</source>
          .
          <volume>33</volume>
          (
          <issue>2</issue>
          ) (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          46.
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>What BPM technology can do for healthcare process support</article-title>
          .
          <source>In: AIME'11</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          47.
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rinderle-Ma</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Flexibility in Process-Aware Information Systems</article-title>
          . In: Trans.
          <article-title>on Petri Nets and Other Models of Concurrency II (</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          48.
          <string-name>
            <surname>Reiter</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems</article-title>
          . The MIT Press (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          49.
          <string-name>
            <surname>Sonnenberg</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hagerty</surname>
            ,
            <given-names>C.G.</given-names>
          </string-name>
          :
          <article-title>Computer-Interpretable Clinical Practice Guidelines. Where are we and where are we going? Yearbook of Medical Inf</article-title>
          .
          <volume>45</volume>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          50.
          <string-name>
            <surname>ter Hofstede</surname>
          </string-name>
          , A.,
          <string-name>
            <surname>van der Aalst</surname>
          </string-name>
          , W.,
          <string-name>
            <surname>Adams</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russell</surname>
          </string-name>
          , N.:
          <article-title>Modern Business Process Automation: YAWL and its Support Environment</article-title>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          51.
          <string-name>
            <surname>Vaculin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hull</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heath</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cochran</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nigam</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sukaviriya</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Declarative business artifact centric modeling of decision and knowledge intensive business processes</article-title>
          .
          <source>In: EDOC '11</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          52.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verbeek</surname>
            , H., van Dongen,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kindler</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , Gunther, C.:
          <article-title>Process mining: a two-step approach to balance between under tting and over tting</article-title>
          .
          <source>Software and Systems Modeling</source>
          <volume>9</volume>
          ,
          <issue>87</issue>
          {
          <fpage>111</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          53.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.:</given-names>
          </string-name>
          <article-title>The application of petri nets to work ow management</article-title>
          .
          <source>Journal of Circuits, Systems, and Computers</source>
          <volume>8</volume>
          (
          <issue>1</issue>
          ),
          <volume>21</volume>
          {
          <fpage>66</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          54.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          : Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          55.
          <string-name>
            <surname>van der Aalst</surname>
          </string-name>
          , W.M.P.,
          <string-name>
            <surname>van Dongen</surname>
            ,
            <given-names>B.F.</given-names>
          </string-name>
          , Gunther,
          <string-name>
            <given-names>C.W.</given-names>
            ,
            <surname>Rozinat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Verbeek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Weijters</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          :
          <article-title>Prom: The process mining toolkit</article-title>
          .
          <source>In: BPM'09 (Demos)</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          56.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikolov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Mining e-mail messages: Uncovering interaction patterns and processes using e-mail logs</article-title>
          .
          <source>IJIIT</source>
          <volume>4</volume>
          (
          <issue>3</issue>
          ),
          <volume>27</volume>
          {
          <fpage>45</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          57.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pesic</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>DecSerFlow: Towards a truly declarative service ow language</article-title>
          .
          <source>In: WS-FM. LNCS</source>
          , vol.
          <volume>4184</volume>
          , pp.
          <volume>1</volume>
          {
          <fpage>23</fpage>
          . Springer (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          58.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pesic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schonenberg</surname>
          </string-name>
          , H.:
          <article-title>Declarative work ows: Balancing between exibility and support</article-title>
          .
          <source>Comp. Sc. - R&amp;D</source>
          <volume>23</volume>
          (
          <issue>2</issue>
          ),
          <volume>99</volume>
          {
          <fpage>113</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref59">
        <mixed-citation>
          59.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weijters</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maruster</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Work ow mining: Discovering process models from event logs</article-title>
          .
          <source>IEEE Trans. K. D. Eng</source>
          .
          <volume>16</volume>
          (
          <issue>9</issue>
          ),
          <volume>1128</volume>
          {
          <fpage>1142</fpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref60">
        <mixed-citation>
          60.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Case handling: a new paradigm for business process support</article-title>
          .
          <source>Data &amp; Know. Eng</source>
          .
          <volume>53</volume>
          (
          <issue>2</issue>
          ) (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref61">
        <mixed-citation>
          61.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peleg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boxwala</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenes</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , Shortli e, E.:
          <article-title>Representation Primitives, Process Models and Patient Data in ComputerInterpretable Clinical Practice Guidelines: A Literature Review of Guideline Representation Models</article-title>
          .
          <source>Int. J. of Medical Informatics</source>
          <volume>68</volume>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref62">
        <mixed-citation>
          62.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peleg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tu</surname>
            ,
            <given-names>S.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boxwala</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ogunyemi</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenes</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>V.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shortli</surname>
            <given-names>e</given-names>
          </string-name>
          , E.H.:
          <article-title>Design and implementation of the GLIF3 guideline execution engine</article-title>
          .
          <source>J. of Biomedical Informatics</source>
          <volume>37</volume>
          (
          <issue>5</issue>
          ) (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref63">
        <mixed-citation>
          63.
          <string-name>
            <surname>Warren</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kings</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thurlow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davies</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buerger</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simperl</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez-Perez</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ermolayev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghani</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tilly</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Bosser, T.,
          <string-name>
            <surname>Imtiaz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Improving knowledge worker productivity - the Active integrated approach</article-title>
          .
          <source>BT Technology Journal</source>
          <volume>26</volume>
          (
          <issue>2</issue>
          ),
          <volume>165</volume>
          {
          <fpage>176</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref64">
        <mixed-citation>
          64.
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rinderle-Ma</surname>
          </string-name>
          , S.:
          <article-title>Change Patterns and Change Support Features - Enhancing Flexibility in Process-aware Information Systems</article-title>
          .
          <source>Data Knowl. Eng</source>
          .
          <volume>66</volume>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref65">
        <mixed-citation>
          65.
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wild</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lauer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Improving Exception Handling by Discovering Change Dependencies in Adaptive Process Management Systems</article-title>
          . In: BPI'
          <volume>06</volume>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref66">
        <mixed-citation>
          66.
          <string-name>
            <surname>Weijters</surname>
          </string-name>
          , A.,
          <string-name>
            <surname>van der Aalst</surname>
          </string-name>
          , W.:
          <article-title>Rediscovering work ow models from event-based data using little thumb</article-title>
          .
          <source>Integrated Computer-Aided Engineering 10</source>
          ,
          <year>2003</year>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref67">
        <mixed-citation>
          67.
          <string-name>
            <surname>Wen</surname>
          </string-name>
          , L.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.:
          <article-title>Mining process models with non-free-choice constructs</article-title>
          .
          <source>Data Min. Knowl. Discov</source>
          .
          <volume>15</volume>
          (
          <issue>2</issue>
          ),
          <volume>145</volume>
          {
          <fpage>180</fpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref68">
        <mixed-citation>
          68.
          <string-name>
            <surname>Westergaard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Better algorithms for analyzing and enacting declarative workow languages using LTL</article-title>
          . In: BPM'
          <volume>11</volume>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>