<!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>Incremental Workflow Mining for Process Flexibility</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ekkart Kindler</string-name>
          <email>kindler@uni-paderborn.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vladimir Rubin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wilhelm Sch¨afer</string-name>
          <email>wilhelm@uni-paderborn.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Software Engineering Group, University of Paderborn</institution>
          ,
          <addr-line>Warburger Str. 100, D-33098 Paderborn</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>178</fpage>
      <lpage>187</lpage>
      <abstract>
        <p>Incremental workflow mining is a technique for automatically deriving a process model from the on-going executions of a process. This way, the process model becomes more and more accurate, and is automatically adapted when the process is being changed. Therefore, incremental workflow mining could help in flexible workflow support: In this paper, we describe a setting that combines incremental workflow mining with gradually increasing the control of a workflow system. Process mining is an active research area. Most of the existing process mining algorithms need a log of the activities resp. the tasks of the process executions. In practice, however, many systems used for executing the processes are not aware of the activities - they see only the documents and how they are changed. Therefore, they do not provide activity logs. In order to make process mining available for this kind of systems, this paper improves an algorithm that identifies the activities from the accesses to documents. We call this algorithm task mining. In combination with our incremental workflow mining approach, task mining makes process mining available for many areas that use document management systems, version management systems or product data management systems. Originally, our incremental workflow mining approach aimed at increasing the maturity level of software enterprises. But, the methods can be applied to any kind of processes that are supported by some kind of system that is aware of documents and document changes during the execution of the processes.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Process mining [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] denotes a bunch of techniques that automatically extract a
process model (process type) from the execution of one or more process instances
of the corresponding process. The information on the actual execution, typically,
comes from the logs of some workflow management system or of some standard
software. By using logs of more and more executions, the models become more
and more accurate and reliable. In combination with increasing the control of
the workflow system, workflow mining allows to gradually move from ad-hoc
workflows without any process model to strongly structured workflows.
      </p>
      <p>
        Some process mining techniques do not require that all executions of the
processes need to be there right from the beginning. Rather, the process model
is changed, once new information on the execution of some of its instances is
available. This way, a process model will incrementally be changed when its
executions change. Therefore, process mining is one technique for automatically
achieving process flexibility and, in particular, incremental process type
evolution [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ].
      </p>
      <p>Most process mining techniques rely on the fact that there are logs of the
tasks that are executed while a process is running. In our terminology, a task
denotes a unit of works represented in a process model. We call an execution of
a task, i. e. its instance, an activity. Therefore, we call a log of executed tasks an
activity log. A process mining algorithm extracts the order in which the
activities have been executed from the activity log and reconstructs a process model
from this information. The problem, however, is that many systems that are
used for executing the processes do not provide activity logs. For example,
document management systems such as software configuration management (SCM)
systems or product data management (PDM) systems or version management
systems integrated in enterprise resource planning (ERP) systems are aware of
the documents and the changes made; but, they are not aware of the tasks resp.
activities of the underlying processes. Therefore, the event logs or audit
information of these systems do not provide the information on activities that is needed
for traditional process mining techniques.</p>
      <p>
        In order to improve this situation, we had a fresh look to process mining and
devised a set of algorithms for mining processes from document versioning logs,
which we called incremental workflow mining [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. These algorithms allow us to
mine process models from audit information of document management systems.
Here, we will not go into the details of our approach. Rather, we will show how
to obtain the information necessary for mining tasks. This information is derived
from the versioning logs in combination with the model that needs to be defined
anyway in order to obtain a quality certificate, i.e. the model of dependencies
between documents.
      </p>
      <p>In this paper, we present the task mining technique – which is the missing
ingredient for completing our incremental workflow mining approach. More
importantly, however, we discuss how the incremental workflow mining approach
in combination with gradual workflow support can be exploited for achieving
flexible workflow support.</p>
      <p>The paper is structured as follows: We start with an overview of related
work. In Sect. 3, we discuss the relation of process mining and flexible workflow
support and how flexible workflow support could benefit from workflow mining.
Then, we discuss which information is available in typical document management
systems (Sect. 4) and how this information could be exploited for identifying the
activities (Sect. 5).</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        A lot of work has been done in the area of process flexibility since the 90ties [
        <xref ref-type="bibr" rid="ref7 ref8 ref9">7–9</xref>
        ].
Flexibility, dynamic process change and process evolution belong to the major
research topics both in the area of business process management [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and in the
area of software processes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In these areas, people distinguish between process
model flexibility and process instance flexibility. This difference is also crucial
for the other important research domains, such as process mining.
      </p>
      <p>
        The research in the area of process mining started in the mid 90ties with new
approaches to the grammar inference problem proposed by Cook and Wolf [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
The first application of “process mining” to the workflow domain was presented
by Agrawal in 1998 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The approach of Herbst and Karagiannis [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] uses
machine learning techniques for deriving the workflow models. The foundational
approach to workflow mining was presented by van der Aalst et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Within
this approach, the α-mining algorithm for discovering workflow models, and its
improvements are presented.
      </p>
      <p>
        The mining-based approach for process evolution and aligning the model and
the instance flexibility is researched by Weber et al. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and is based on adaptive
process management and case-base reasoning paradigms. This approach uses
activity logs and, thus, implicitly assumes the existence of a process management
system, which produces such logs. In contrast to this approach, in the present
paper, we start with the logs of document management system and gradually
introduce the workflow management system to the company.
      </p>
      <p>
        So, current process mining approaches start dealing with rich and complex
sources of information about process instances. In this context, the problem of
type discovering discussed in Sect. 5 becomes more and more important.
Similar problems were also discovered in the other research areas, such as reverse
engineering and clustering. In reverse engineering, people use a program
runtime information (execution history) to assist building the class diagram that
reflects the real implementation [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Clustering data mining techniques [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], for
example, divide data into groups of similar objects (types, in our context).
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Incremental Process Change</title>
      <p>
        In this section, we describe our incremental workflow mining approach (for
further details, see [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) and its advantages concerning flexibility in business
processes. This semi-automatic approach is used for constructing process models
from the information about process instances and, thus, for keeping the models
compliant to the rapidly changing instances.
      </p>
      <p>The incremental workflow mining is useful for companies that utilize
document management systems for a collaborative work of their employees. We use
versioning logs of these document management systems (see Sect. 4) as a source
of information about process instances. So, the approach consists of the following
steps, see Fig. 1:</p>
      <p>First, we do activity mining from the versioning logs. As a result, we get a
set of activities.</p>
      <p>Second, we take the set of discovered activities and do reverse engineering
- derive the overall pro cess mo del in a system internal formalism (Petri
nets). This mo del contains b ehavioural, informational and organizational
p ersp ectives of the pro cess.</p>
      <p>
        Third, we make the transformation from the system internal mo del to the
external mo del (UML2.0 Activity Diagrams [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]). This external pro cess mo del
is shown to managers and employees in the company.
      </p>
      <p>Document Management</p>
      <p>System
A 01.01.05 14:30 W status: initial
B 01.0A10.015.015. 0:0501X4:s3t0atWuss:tgaetunse:rainteitidal
C 05.B010.015.010.0:0501Y5:0st0atXu s:t aint uitsia:lgenerated
D 07.C010.055.A0101. 01:05.01Z.0:s05t0a1tY4u:3s:0tapWteunsds:tiangtiutisa:l initial
A 01.0D20.075.B0101.01:05.01W1.0:05s0t1aZ5tu:s0t0:aitnXuitsia:t alpteunsd:ignegnerated
B 15.0A20.015.C01270.0:505.01X1. 0:s05t0a1tW0u:s0s:0tgaeYtunset:raitnueitsida:linitial
D 20.B021.055.D00209.07:05.01Z7. 0:s05t0a1tX1u:s0:t0aintZuitisa:tlagteunse:rpaetending
C 28.D022.05.A01208. 01:45.0502Y9.0:s05t0a1tZ1u:s0:t0aptWeunssd:tiangtiuiasl: initial</p>
      <p>C 28.B021.055.0128.0:4551Y7:0s0taXtus:tapteunsd:ignegnerated</p>
      <p>D 20.02.05 09:00 Z status: initial
C 28.02.05 18:45 Y status: pending</p>
      <p>1
Activities
2</p>
      <p>Company
Employee</p>
      <p>Manager
3
Process</p>
      <p>Model</p>
      <p>So, in the context of changing pro cesses, the approach is aimed to fill the
gap b etween process type evolution and process instance evolution. Our activity
mining and reverse engineering algorithms provide an automatic supp ort for
redesigning the pro cess. They use the information ab out deviation in the pro cess
instances for this redesign.</p>
      <p>The approach works incrementally, i.e. as so on as new pro cess instance is
executed and, consequently, new records are added to the versioning log, we
refine the set of activities and the pro cess mo del derived on the previous step.
Thus, starting with revolutionary changes in the first step, when there is no
pro cess mo del at all, in a consecutive manner we come to incremental changes
in the further steps.</p>
      <p>Following our approach, after the pro cess mo dels are discovered, they can b e
inserted to the Workflow Management System (WfMS), where they are
maintained and executed. But the role of the WfMS and its user supp ort evolves
with the time. Thus, on the first steps, it is utilized only for storing the newly
discovered mo dels; after further refinements, when pro cess mo dels b ecome more
faithful, the WfMS starts advising and guiding the users in the company. This
increasingly changing control of the WfMS in the company is called gradual
workflow support. So, introducing incremental workflow mining and gradual workflow
support in the company enables dealing with the flexibility in a formal and
documented manner.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Document Management Systems and their Logs</title>
      <p>In this section, we deal with the sources, from which the audit information on
the process instances can be obtained. It can be obtained from different types
of Document Management Systems: Software Configuration Management
systems (SCM), Product Data Management systems (PDM), Version Management
systems integrated in Enterprise Resource Planning systems (ERP). All these
systems are widely used in companies working in the areas of software
engineering, mechanical engineering, electrical engineering, telecommunications and
others. For example, SCM systems are an essential part of modern software
engineering environments and their use is stipulated in widely accepted software
process improvement frameworks, such as Capability Maturity Model (CMM).</p>
      <p>However, the problem is that these systems do not provide logs of activities,
but data about the informational and the organizational perspectives of the
process. In the rest of the paper, we focus on the area of software processes;
but our approach is general and applicable to the other areas, where document
management systems are used for collaborative work of employees in the product
development process.</p>
      <p>
        In spite of the fact that there is such a variety of different document
management systems, their typical auditing capabilities, such as history, logging and
traceability [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] produce similar results. The results differ only syntactically and
since they are obtained from different systems, people are using different
commands and utilities. We call these results versioning logs and present a general
format of these logs in this section.
      </p>
      <p>
        In order to extract this format we have looked at the versioning logs
containing information about commits of documents in several SCM and PDM systems,
such as: CVS [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and Subversion (open-source file-based version management
systems), Visual SourceSafe [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] (commercial filed-based version management
system for small developer teams), ClearCase [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] (SCM system for large
developer teams), Metaphase and Teamcenter (PDM systems).
      </p>
      <p>An example of a versioning log with the information which is generally
available in these systems is presented in Table 1. The log consists of records (rows).
Each record contains information about the name of the committed document,
e.g. “A”, the timestamp of the commit – “01.01.05 14:30”, the name of the user
who did it – “W” and the comment of the user – “status: initial”. The versioning
log contains many records related to different executions of different processes.
For example, the versioning log in Table 1 contains two executions of one
process, they are separated with a double line. The set of records, that belong to
one execution of one process is called the execution log.</p>
      <p>When dealing with the versioning logs the following problems occur: which
records belong to which execution logs and which execution logs belong to which
process; do all the execution logs use the same naming conventions; how big are
differences between timestamps of two records when they belong to the same
commit, etc. In this paper, we assume that we know the structure of execution
logs, naming conventions are the same in the whole log and records with different
timestamps belong to different commits.</p>
      <p>Here, we deal with the following problem: versioning logs do not contain
information about document types, but only information about concrete names
of concrete documents and sequence of their commits. The incremental workflow
mining algorithms discover the behaviour of the process from such versioning logs
and combine it with informational and organizational perspectives. But deriving
the input and the output of activities is not fully covered by these algorithms
because of the missing type information. Thus, the process model, which can be
mined from the logs, can be neither reused in the other projects, nor changed
by the people that were not involved in the concrete process.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Discovering the Types</title>
      <p>In this section, we propose a solution to the problem described above and raise
the following questions: 1. how do the informational models (document type
models) look like? 2. is there an algorithm for assigning the types to concrete
documents using these models?
Informational Model
One of the most important requirements for modern SCM and PDM systems
is the capability of informational modelling. In the area of PDM, for example,
there is a STEP (Standard for the Exchange of Product Model Data) ISO
standard (ISO DIS 10303), which includes the EXPRESS language for defining the
product models.</p>
      <p>
        Like for versioning logs, different systems have different informational
models. But there are typical relationships used in most of these models [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], for
example dependency relationship. This relationship implies that the contents of
the dependent document must be consistent with the contents of the master
document.
      </p>
      <p>An example of the informational model is shown in Fig. 2 as a UML class
diagram. In the example, Code depends on the Design. In our case, this is also
a lifecycle dependency – the document Code can appear in the system only after
the Design document.</p>
      <p>&lt;&lt;dt&gt;&gt;
Design
dep
&lt;&lt;dt&gt;&gt;
Code
dep
dep
&lt;&lt;dt&gt;&gt;
Review
&lt;&lt;dt&gt;&gt;</p>
      <p>TestResults
Now, besides the versioning log with document names, we also have a set of
document types and a dependency relationship on this set. Here, we propose a
principal algorithm for assigning the types to the documents in the log.</p>
      <p>Let D be a set of documents in the log with cardinality k = |D|, DT be
a set of document types with cardinality n = |DT | and dep ⊆ DT × DT be
a dependency relationship on the set of document types. The type discovering
algorithm is the following:
– If k &lt;= n, find all possible assignments of types to the documents, i.e. find
all the k-subsets on DT .
– If k &gt; n, find all possible assignments of types to the documents so, that
every type is assigned at least once. In this case, we will get several documents
of the same type.
– For each assignment, for each execution log, check whether dependency
relationship is fulfilled (so that dependent document does not appear earlier
than the document it depends on). If at least one execution log exists, where
dependency relationship is not fulfilled, the assignment is wrong and should
be deleted.</p>
      <p>Thus, as a result, we assign the types, which do not contradict with the
dependencies, to the documents.</p>
      <p>For the log in Table 1 and document types in Fig. 2, if we take the
4subset {Design, Review, TestResults, Code} and add this type information to
the document names (we use “:” notation to separate the name and the type),
we get the following orders of documents in the logs: (A:Design, B:Review,
C:TestResults, D:Code) for the first execution log and (A:Design, B:Review,
D:Code, C:TestResults) for the second.</p>
      <p>In the first execution log, the document of type T estResults appears earlier
than the Code document, but it contradicts the dependency (TestResults,Code),
which shows that T estResults is dependent on Code and not vice versa. So,
the selected subset is not correct. The same way, we can check all the other
subsets and detect, that the only correct subsets are {Design, Code, TestResults,
Review} and {Design, Code, Review, TestResults}. If we had another execution
log containing additional order, for example {A, D, B, C}, we could see, that
the only correct assignment of types is {Design, Code, TestResults, Review}.</p>
      <p>The success of the type detection algorithm is dependent on the number
of execution logs and the number of dependencies. If the numbers of logs and
dependencies are not sufficient, we do not come to an unambiguous set of types
in spite of the fact that we are checking all the possible type permutations. In
this case, we need interaction with a user, who has to give us the types of some
documents.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we have presented the advantages of the incremental workflow
mining approach and gradual workflow support in the context of flexible processes.
This semi-automatic approach uses information about the changing process
instances and derives the process model compliant to them. The information about
instances is obtained from the logs of document management systems. We have
also looked at different document management systems and proposed a uniform
format for these logs.</p>
      <p>In the second part of the paper, we have presented the problem of
discovering the types of documents in the logs of document management systems and
proposed a solution for it. This solution is used to augment the incremental
workflow mining approach with information about tasks and, therefore, to enable task
mining.</p>
      <p>In order to deal with this problem, we need other information in addition
to the versioning logs. This information contains the types of documents and
dependencies between them. After executing the type discovering algorithm and
possibly interacting with the user, we get the assignment of types to the
documents in the log. The type discovering algorithm was implemented in our research
prototype and tried out on several examples from the software process domain,
see Fig. 3.</p>
      <p>Neither the advantages of incremental process mining techniques in the
context of changing processes, nor the problem of discovering the types were
discussed in details in the areas of process flexibility and process mining. But using
new process management and new support systems and obtaining more and more
complex multi perspective log information there makes the stated problems more
and more prominent.</p>
      <p>So, the future research in this area must deal with the user role in incremental
workflow mining and in guiding process flexibility in the company. Since the
input information for the algorithms is defined manually and the logs can contain
noise or be incomplete, the role of interactive type detection and mining, which
lead to unambiguous solutions, will become more and more important.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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 EventBased Data</article-title>
          .
          <source>ACM Trans. Softw. Eng. Methodol</source>
          .
          <volume>7</volume>
          (
          <year>1998</year>
          )
          <fpage>215</fpage>
          -
          <lpage>249</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>van der Aalst</surname>
            , W., van Dongena,
            <given-names>B.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herbst</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marustera</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schimm</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weijters</surname>
            ,
            <given-names>A.J.M.M.:</given-names>
          </string-name>
          <article-title>Workflow mining: A survey of issues and approaches</article-title>
          .
          <source>Data &amp; Knowledge Engineering</source>
          <volume>47</volume>
          (
          <year>2003</year>
          )
          <fpage>237</fpage>
          -
          <lpage>267</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bandinelli</surname>
            ,
            <given-names>S.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fugetta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghezzi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Software Process Model Evolution in the SPADE Environment</article-title>
          .
          <source>IEEE Transactions on Software Engineering</source>
          <volume>19</volume>
          (
          <year>1993</year>
          )
          <fpage>1128</fpage>
          -
          <lpage>1144</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Casati</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ceri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pernici</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzi</surname>
          </string-name>
          , G.:
          <article-title>Workflow Evolution</article-title>
          . In: International Conference on Conceptual Modeling / the Entity Relationship Approach. (
          <year>1996</year>
          )
          <fpage>438</fpage>
          -
          <lpage>455</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kindler</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , Sch¨afer, W.:
          <article-title>Incremental Workflow mining based on Document Versioning Information</article-title>
          . In Li,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Boehm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Osterweil</surname>
          </string-name>
          , L.J., eds.
          <source>: Proc. of the Software Process Workshop</source>
          <year>2005</year>
          , Beijing, China. Volume
          <volume>3840</volume>
          of LNCS., Springer (
          <year>2005</year>
          )
          <fpage>287</fpage>
          -
          <lpage>301</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kindler</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , Sch¨afer, W.:
          <article-title>Activity mining for discovering software process models</article-title>
          . In Biel,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Book</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Gruhn</surname>
          </string-name>
          , V., eds.
          <source>: Proc. of the Software Engineering 2006 Conference</source>
          , Leipzig, Germany. Volume P-79 of LNI.,
          <source>Gesellschaft fu¨r Informatik</source>
          (
          <year>2006</year>
          )
          <fpage>175</fpage>
          -
          <lpage>180</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ellis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keddara</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rozenberg</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Dynamic change within workflow systems</article-title>
          .
          <source>In: COCS '95: Proceedings of conference on Organizational computing systems</source>
          , New York, NY, USA, ACM Press (
          <year>1995</year>
          )
          <fpage>10</fpage>
          -
          <lpage>21</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>A framework for dynamic changes in workflow management systems</article-title>
          .
          <source>In: DEXA '97: Proceedings of the 8th International Workshop on Database and Expert Systems Applications</source>
          , Washington, DC, USA, IEEE Computer Society (
          <year>1997</year>
          )
          <fpage>42</fpage>
          -
          <lpage>48</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Heinl</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horn</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jablonski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neeb</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teschke</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A comprehensive approach to flexibility in workflow management systems</article-title>
          .
          <source>In: WACC '99: Proceedings of the international joint conference on Work activities coordination and collaboration</source>
          , New York, NY, USA, ACM Press (
          <year>1999</year>
          )
          <fpage>79</fpage>
          -
          <lpage>88</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <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 Workflow Logs</article-title>
          .
          <source>In: Proceedings of the 6th International Conference on Extending Database Technology</source>
          , Springer-Verlag (
          <year>1998</year>
          )
          <fpage>469</fpage>
          -
          <lpage>483</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Herbst</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karagiannis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>An Inductive approach to the Acquisition and Adaptation of Workflow Models</article-title>
          . citeseer.ist.psu.edu/herbst99inductive.html (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Weijters</surname>
          </string-name>
          , A.,
          <string-name>
            <surname>van der Aalst</surname>
          </string-name>
          , W.:
          <article-title>Process mining: discovering workflow models from event-based data</article-title>
          .
          <source>In: Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC</source>
          <year>2001</year>
          ).
          <article-title>(</article-title>
          <year>2001</year>
          )
          <fpage>283</fpage>
          -
          <lpage>290</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <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</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wild</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Towards a framework for the agile mining of business processes</article-title>
          . In Bussler,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Haller</surname>
          </string-name>
          , A., eds.: Business Process Management Workshops:
          <article-title>BPM 2005 International Workshops</article-title>
          ,
          <string-name>
            <surname>BPI</surname>
          </string-name>
          , BPD, ENEI, BPRM, WSCOBPM,
          <string-name>
            <surname>BPS</surname>
          </string-name>
          , Nancy, France,
          <year>September 5</year>
          ,
          <year>2005</year>
          .
          <source>Revised Selected Papers</source>
          . Volume
          <volume>3812</volume>
          of LNCS., Springer (
          <year>2006</year>
          )
          <fpage>192</fpage>
          -
          <lpage>202</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Gu´eh´eneuc,
          <string-name>
            <given-names>Y.G.</given-names>
            ,
            <surname>Douence</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Jussien</surname>
          </string-name>
          , N.:
          <article-title>No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs</article-title>
          .
          <source>In: ASE '02: Proceedings of the 17th IEEE international conference on Automated software engineering</source>
          , Washington, DC, USA, IEEE Computer Society (
          <year>2002</year>
          )
          <fpage>117</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Berkhin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Survey of clustering data mining techniques</article-title>
          .
          <source>Technical report, Accrue Software</source>
          , San Jose, CA (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <source>OMG: UML 2.0 Superstructure Specification. Version 2</source>
          .0 ptc/03-08-02, Object Management Group (
          <year>2003</year>
          )
          <article-title>Final Adopted Specification</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Frauf</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeller</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Software configuration management: State of the art, state of the practice</article-title>
          .
          <source>In: 9th International Symposium on System Configuration Management (SCM-9)</source>
          . (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Fogel</surname>
            ,
            <given-names>K.F.</given-names>
          </string-name>
          :
          <article-title>Open Source Development with CVS</article-title>
          . Coriolis Group Books (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Microsoft</surname>
          </string-name>
          : Visual SourceSafe. Web: http://msdn.microsoft.com/vstudio/previous/ ssafe/ (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Rational Software Corporation: Rational ClearCase Rational ClearCase LT</surname>
          </string-name>
          .
          <source>Technical Report 800-026160-000</source>
          , Rational Software Corporation (
          <year>2003</year>
          ) Version:
          <year>2003</year>
          .
          <volume>06</volume>
          .00 and later.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Conradi</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Westfechtel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Version models for software configuration management</article-title>
          .
          <source>ACM Comput. Surv</source>
          .
          <volume>30</volume>
          (
          <year>1998</year>
          )
          <fpage>232</fpage>
          -
          <lpage>282</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>