<!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>Towards a Compendium of Process Technologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Artem Polyvyanyy</string-name>
          <email>artem.polyvyanyy@qut.edu.au</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matthias Weidlich</string-name>
          <email>weidlich@tx.technion.ac.il</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Israel Institute of Technology</institution>
          ,
          <addr-line>Haifa</addr-line>
          ,
          <country country="IL">Israel</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Queensland University of Technology</institution>
          ,
          <addr-line>Brisbane</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the idea of a compendium of process technologies, i.e., a concise but comprehensive collection of techniques for process model analysis that support research on the design, execution, and evaluation of processes. The idea originated from observations on the evolution of process-related research disciplines. Based on these observations, we derive design goals for a compendium. Then, we present the jBPT library, which addresses these goals by means of an implementation of common analysis techniques in an open source codebase.</p>
      </abstract>
      <kwd-group>
        <kwd>Compendium</kwd>
        <kwd>process technology</kwd>
        <kwd>process analysis</kwd>
        <kwd>jBPT</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Study of processes, i.e., orderings of observed events, is integral to the eld of
information systems. Usually, processes are studied by means of models. A process
model is a particular representation of processes of the same nature. A work ow
model and a business process model are examples of process models within the
information systems discipline. Many research activities that deal with the design,
execution, and evaluation of processes, rely on analysis of process models. Results
of these endeavors are often validated by means of prototypical implementations.
Such prototypes serve as a proof of concept and provide other researchers with a
reference to enter competition for better results.</p>
      <p>Unfortunately, such prototyping is usually hindered by di erent
programming languages, frameworks, availability of other scienti c prototypes and their
reusability. Moreover, a considerable portion of a researcher's time must often be
spent on making results applicable for di erent contexts, e.g., for process models
captured in di erent modeling languages, such as BPMN and EPC. This holds
even though these di erent contexts usually share similar characteristics. For
instance, languages for specifying process models are rather similar w.r.t. the
core modeling elements and their semantics.</p>
      <p>This paper proposes design principles for a compendium of process technologies
and discusses a concrete instantiation of these principles in the jBPT project1.
The project develops a library of often used resources and algorithms when
1 jBPT stands for \Business Process Technologies for Java".
dealing with analysis of process models. The library is implemented in Java and
published2 as open source under the GNU Lesser GPL license. The Java language
is often chosen as a programming language for scienti c prototypes due to its
\architecture-neutral and portable" principle, which is also summarized in the
Java promise of \write once, run anywhere" (despite of the fact that this claim is
still arguably questionable). The jBPT project enjoys the cross-platform bene ts
of Java but also incorporates its own design philosophy which aims at maximal
reuse of developed techniques.</p>
      <p>The core design principle of the compendium is to bridge the heterogeneity of
di erent process modeling languages by a uni ed framework that builds upon the
most generic notions of graph theory. The methods and techniques included in
the jBPT library are implemented for the common entities of di erent modeling
languages and, thus, often can be reused for models captured in di erent languages.
This principle has found its wide use in numerous research prototypes.</p>
      <p>The next section lists observations on research that led to the idea of a
compendium of process technologies. Sect. 3 summarizes design goals for the
compendium. Sect. 4 presents the jBPT library (an instantiation of the
compendium design), gives a usage example, outlines its functionality, and illustrates
its maturity by enumerating research projects which rely on the library. Sect. 5
positions jBPT among other research frameworks, before we conclude the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Observations on Process Research</title>
      <p>In order to derive requirements for a compendium of process technologies, we
start with a number of observations on process-related research.</p>
      <p>The Nucleus of Process Modeling Languages. First and foremost, we
observe that the plethora of process modeling languages, all de ning their own
syntax, semantics, and notation, largely hides the fact that most languages have
a common conceptual root. On the one hand, they can essentially be seen as
control ow graphs, with nodes relating to functional entities (what is done?) and
edges de ning the coordination for process execution (how is it done?). Clearly,
process models capture more than the functional and the control ow perspective.
However, most other perspectives, such as data handling and organizational
structures, are often attached to the control ow graph (e.g., by partitioning the
graph with swimlanes for organizational roles). Hence, the control ow graph can
be seen as the backbone of any process model. On the other hand, we observe
that control ow graphs are not arbitrary graphs, but are structured by `common
behaviors' of processes. Execution alternatives, concurrency, repetitive behavior,
and hierarchical re nement are basic behavioral patterns that are supported
by all major process modeling languages. Although languages de ne di erent
mechanisms for realizing these patterns, they lead to similar control ow graphs.</p>
      <p>The Need for Evaluation. In recent years, there has been a clear trend
towards empirical evaluation of process research. Depending on the type of
the concept that is to be validated, user studies or experiments with large</p>
      <sec id="sec-2-1">
        <title>2 http://code.google.com/p/jbpt/</title>
        <p>
          (and often real-world) datasets are conducted. Consequently, virtually all newly
proposed concepts and techniques are implemented at least in prototypes. Yet,
most evaluations reported in research papers are not reproducible. This is only
partly due to the non-availability of non-disclosed datasets. Often, the actual
implementations are either not available or are hard to run and extend in the
absence of a generic research framework for process model analysis. Also, we
observe that a lot of functionality clones exist across these research prototypes,
a result of redundant development e orts. Generic research frameworks may
overcome these problems as successfully demonstrated in certain areas, e.g., by
the ProM framework [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] for process mining research.
        </p>
        <p>
          Broad Applicability of Structural or Behavioral Concepts. Another
remarkable trend in process research is the broad applicability of certain concept
and techniques for a large number of research questions. That is, a number of
structural and behavioral concepts and techniques are on the one hand speci c to
process models (and thus not covered by frameworks for graph analysis), but on
the other hand general enough to address a variety of research issues. Prominent
examples are the Re ned Process Structure Tree [
          <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
          ] and Behavioral Pro les [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]
of a process model. The former has been applied, for instance, for modeling
support, veri cation of process models, and clone detection in large repositories.
The latter turned out to be useful for consistency analysis, the de nition of
re-usable action patterns, and compliance checking. A compendium of process
technologies that features these techniques, therefore, supports the creation of
prototypes in a broad context.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Design Goals</title>
      <p>Based on the observations outlined in the previous section, this section enumerates
design goals for a compendium of process technologies.</p>
      <p>Reuse of Resources and Algorithms. The core idea behind the design
of a compendium is reuse of functionality in all possible contexts. Resources
and algorithms needed to conduct process model analysis should be applicable
in di erent contexts. Here, di erent contexts are often dictated by di erent
modeling languages. As detailed above, these languages usually operate within
the common notion of a control ow graph. Therefore, the support of several
abstraction levels when working with the notion of a control ow graph, which
might range from a concrete syntax speci cation of a modeling notation to a
generic graph-based formalism, is identi ed as a fundamental requirement for the
design of a compendium. Every resource and every algorithm from a compendium
should address the most abstract level of the control ow notion possible. This
principle allows maximal reuse of techniques across all contexts that share the
same abstraction level of concepts under consideration.</p>
      <p>Don't Repeat Yourself. Every implementation of an analysis technique
should be unique within a compendium. All tests and optimizations should target
this unique implementation.</p>
      <p>E ective Modularity. It is expected that a concrete realization of a
compendium will comprise a large collection of methods and techniques. Therefore,
the availability of mechanisms for its e ective modularization is essential. A
compendium should allow natural identi cation of its independent functional
components, which may be separated and/or recombined.</p>
      <p>
        Utility Functionality. Research prototypes often require utility
functionality besides the actual implementation of the analysis technique. An example
would be the support of di erent serialization formats. In particular, serialization
formats for common modeling notations and means to generate graph de nitions
used by standard software for graph visualization, e.g., dot graph description
language [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], are required to support the implementation of analysis techniques.
      </p>
      <p>Publishing Philosophy. To support researchers during the implementation
of research prototypes, a compendium of process technologies needs to be publicly
available with little restrictions on it usage. Further, extensions and future
developments of a compendium are fostered by an open source publishing philosophy.
In particular, a compendium published under the GNU Lesser GPL3 ensures
that any extensions will be available for the research community.
4</p>
    </sec>
    <sec id="sec-4">
      <title>The jBPT Library</title>
      <p>To achieve the design goals for a compendium of process technologies, we
developed the jBPT library. In this section, we review the essentials of this library
by rst sketching its architecture and giving an illustrative example of how the
library can facilitate development of process model analysis techniques. Finally,
we lists some of the most used functionality of the library and give an overview
of its application in concrete research projects.</p>
      <p>Architecture. An excerpt of the core structure of jBPT is shown in Fig. 1.
It illustrates the interface and class hierarchy to capture di erent types of graphs,
starting with multi-hypergraphs as the most general model. It also shows that
all graph models are typed with generics, which allows, for instance, to de ne a
PetriNet as an AbstractDirectedGraph with parameter E being bound to Flow
classes and parameter V to Node classes. A Flow class represents a specialization
of a directed edge, i.e., a AbstractDirectedEdge with V being bound to Node
classes. The de nition of process model classes, or more speci c classes for BPMN
or EPC models, and Petri nets as specializations of di erent kinds of graphs is the
basis for extensive reuse of analysis algorithms. Those may be implemented on
the according level of the graph hierarchy and then be used for all specializations.</p>
      <p>
        Illustrative Example. To illustrate how jBPT facilitates the development
of research prototypes, we consider two properties of process models. First,
structural soundness 4 relates to the structure of a process model, see [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], and
holds if the model has at least one source node (no direct predecessors) and at
least one sink node (no direct successors), such that each node of the model lies
on a path from some source to some sink. Intuitively, execution is instantiated
at some of the source nodes and terminates eventually at some of the model's
sink nodes. Moreover, each node should have a chance to contribute to some
3 All changed versions of a GNU Lesser GPL program must be released as free software.
4 Not to be confused with the classical notion of soundness, a behavioral criterion [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
&lt;E extends IHyperEdge&lt;V&gt;,
      </p>
      <p>V extends IVertex&gt;
AbstractMultiHyperGraph</p>
      <p>GObject
&lt;E extends IDirectedHyperEdge&lt;V&gt;,</p>
      <p>V extends IVertex&gt;
AbstractMultiDirectedHyperGraph</p>
      <p>&lt;E exVteenxdtsenIdDsirIeVcetretdeExd&gt;ge&lt;V&gt;,
AbstractMultiDirectedGraph</p>
      <p>&lt;E exVteenxdtsenIdDsirIeVcetretdeExd&gt;ge&lt;V&gt;,
AbstractDirectedGraph
ProcessModel</p>
      <p>PetriNet</p>
      <p>Vertex
Node</p>
      <p>IGObject
IVertex</p>
      <p>&lt;V extends IVertex&gt;
IHyperEdge</p>
      <p>&lt;V extends IVertex&gt;</p>
      <p>IDirectedHyperEdge
&lt;V extends IVertex&gt;
AbstractHyperEdge</p>
      <p>&lt;V extends IVertex&gt;
AbstractDirectedHyperEdge</p>
      <p>&lt;V extends IVertex&gt;
AbstractDirectedEdge</p>
      <p>&lt;V extends IVertex&gt;
IDirectedEdge</p>
      <p>&lt;V extends IVertex&gt;
IEdge
Bpmn</p>
      <p>Epc</p>
      <p>NetSystem</p>
      <p>Place</p>
      <p>Transition</p>
      <p>
        Flow
execution of the model. Second, we consider testing a Petri net for the structure
of a Work ow net [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], i.e., whether it has a single source node, a single sink node,
such that every node is on some directed path from the source to the sink. Clearly,
the rst question is more generic and relates to process models in general. The
latter, Work ow net structure, strengthens the notion of structural soundness
and is typically applied to Petri nets only.
      </p>
      <p>
        Checking for structural soundness is equivalent to a check of strong
connectedness5 of an enhanced version of the directed graph which is used to describe a
process model, see one possible implementation in the isMultiTerminal function
in DGA.java listing below. The enhanced graph is obtained by introducing a fresh
source vertex (src) and a fresh sink vertex (snk), lines 8{10, to the graph, and
then adding a fresh edge from the fresh sink to the fresh source. A directed graph
describes a structurally correct process model if its enhanced version is strongly
connected. A directed graph is strongly connected if it constitutes a single strongly
connected component (SCC)6. Strongly connected components of directed graphs
are discovered in O(SV S+SES) time with V and E as the sets of vertices and edges of
the graph [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Hence, the isMultiTerminal check of a graph is done in linear time
to its size. Note that prior to returning a result, we remove vertices src and snk
(line 14), which implies removal of all adjacent edges. The isTwoTerminal function
(lines 18{23) restricts the isMultiTerminal check to a single source and a single
sink. Functions isMultiTerminal and isTwoTerminal can be applied to every
Java object which implements the IDirectedGraph interface instantiated with
IDirectedEdge and IVertex types, e.g., a ProcessModel, an EPC, or a PetriNet.
5 A directed graph is called strongly connected if there is a directed path from each
vertex in the graph to every other vertex.
6 A strongly connected component of a directed graph is its maximal strongly connected
subgraph.
As such, a method to implement the structural soundness check for an EPC, simply
requires calling the respective method.
      </p>
      <p>DGA.java { Collection of algorithms to manipulate directed graphs.
public boolean isTwoTerminal(IDirectedGraph&lt;E,V&gt; g) {
if (g==null) return false;
if (this.getSources(g).size()!=1 || this.getSinks(g).size()!=1)
return false;
return this.isMultiTerminal(g);
Below, the generic usage of the outlined functionality is illustrated by the Work ow
net check for PetriNet objects. Function isWorkflowNet simply wraps the
isTwoTerminal function for PetriNet objects, see lines 5{6 below.
PetriNetStructuralClassChecks.java { Structural tests for Petri nets.
1 : public class PetriNetStructuralClassChecks {
2 : ...
3 : public static boolean isWorkflowNet(PetriNet net) {
4 : if (net==null) return false;
5 : DGA&lt;Flow,Node&gt; dga = new DGA&lt;Flow,Node&gt;();
6 : return dga.isTwoTerminal(net);
7 : }
8 : }</p>
      <p>
        jBPT Functionality. Besides already mentioned object models for various
process modeling languages, the jBPT library o ers a collection of supporting
management routines, such as parsing and serialization to standard formats.
Further, the functionality of the jBPT library comprises, among others, basic
graph algorithms, connectivity-based decompositions of graphs and related
process model related applications, e.g., the RPST [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], models and algorithms for
behavioral pro les [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], algorithms for process model similarity (based on the
graph edit distance or behavioral relations), techniques from the theory of net
systems and net systems unfolding, transformations of process models, etc. For
an up-to-date list of all resources and functionality included in the library, please
refer to the jBPT page at Google Code (http://code.google.com/p/jbpt/).
      </p>
      <p>
        Applications. The idea of a compendium of process technologies as
implemented by jBPT proved indeed valuable for the implementation of various
research prototypes. Among others, the following projects are based on jBPT.
bpstruct7 is a collection of techniques proposed in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] for transforming
unstructured process models into well-structured ones.
      </p>
      <p>BPM Academic Initiative8 is an academic version of a professional business
process management tool. It integrates bpstruct through a REST API.
apromore9 is an open source repository to store and disclose process models of
a variety of languages, such as BPMN, EPCs, YAWL, Work ow nets, etc.
The jBPT initiative provides core functionality for the apromore platform.
It underpins the canonical process model format of apromore and many of
its core features and functionalities.</p>
      <p>
        Flexab [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] is a tool that allows for exible abstraction of process models. It
relies on algorithms for behavioral pro les as implemented in jBPT.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Related Work</title>
      <p>
        There are several other research frameworks that have been designed in the spirit
of a compendium of process technologies, yet with a di erent focus. A prominent
example is the ProM framework [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for process mining. It supports the creation
of research prototypes with a plugin infrastructure that allows for implementing
functionality based on the utilities provided by the ProM framework. In contrast
to jBPT, the ProM framework does not focus on providing a set of common
structural and behavioral analysis techniques, but rather features an infrastructure
that also addresses the visualization of process models and includes a GUI for
conducting experiments. Another platform for developing research prototypes for
process management is the Oryx Editor [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. It features a process model repository
and a process model editor that are extensible in terms of modeling languages
and the integration of analysis functionality. However, the Oryx Editor o ers
only limited support for implementing the actual analysis. Hence, it may serve
as a front-end for the visualization and integration of functionality implemented
in jBPT, as demonstrated by Flexab [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] for process model abstraction.
      </p>
      <p>
        Various process model analysis techniques are available on demand in the
Business Process Services10 portal developed by IBM Research. These services can
be invoked for a process model description and, for instance, conduct control ow
analysis or refactor the model. The analysis of interactions between processes
is at the core of the ServiceTechnology toolset11, see also [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. These tools
      </p>
      <sec id="sec-5-1">
        <title>7 http://code.google.com/p/bpstruct/</title>
        <p>8 http://academic.signavio.com/
9 http://code.google.com/p/apromore/
10 http://business-services.researchlabs.ibm.com
11 http://www.service-technology.org/
implement techniques for service composition, discovery, and substitution. Both
toolsets support the development of research prototypes by providing speci c,
encapsulated functionality and, thus, have a di erent focus compared to jBPT,
which aims at supporting the actual development of prototypes with basic data
structures and algorithms.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper, we argued for the creation of a compendium of process technologies.
The idea is to have a comprehensive collection of techniques for process model
analysis, thereby supporting the implementation of research prototypes. Based
on observations on process research, we derived design goals for a compendium.
Further, we presented the jBPT library as a rst implementation of that idea.
This library o ers a broad range of basis analysis and utility functionality and,
due to its open publishing model, can easily be extended. It regularly attracts
over 250 unique Internet visitors per month from more than 50 countries.
Acknowledgments. We highly appreciate the contributions to jBPT made by
the community as detailed at http://code.google.com/p/jbpt/people/list.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Verbeek</surname>
            ,
            <given-names>H.M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buijs</surname>
            ,
            <given-names>J.C.A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>van Dongen</surname>
            ,
            <given-names>B.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          : XES, XESame, and
          <article-title>ProM 6</article-title>
          . In: CAiSE Forum. Vol.
          <volume>72</volume>
          of LNBIP., Springer (
          <year>2010</year>
          )
          <volume>60</volume>
          {
          <fpage>75</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Vanhatalo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Volzer, H.,
          <string-name>
            <surname>Koehler</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The re ned process structure tree</article-title>
          .
          <source>Data Knowl. Eng</source>
          .
          <volume>68</volume>
          (
          <issue>9</issue>
          ) (
          <year>2009</year>
          )
          <volume>793</volume>
          {
          <fpage>818</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Polyvyanyy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanhatalo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Volzer, H.:
          <article-title>Simpli ed computation and generalization of the re ned process structure tree</article-title>
          .
          <source>In: WS-FM</source>
          . Vol.
          <volume>6551</volume>
          of LNCS., Springer (
          <year>2010</year>
          )
          <volume>25</volume>
          {
          <fpage>41</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendling</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>E cient consistency measurement based on behavioral pro les of process models</article-title>
          .
          <source>IEEE Trans. Software Eng</source>
          .
          <volume>37</volume>
          (
          <issue>3</issue>
          ) (
          <year>2011</year>
          )
          <volume>410</volume>
          {
          <fpage>429</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gansner</surname>
            ,
            <given-names>E.R.</given-names>
          </string-name>
          , North,
          <string-name>
            <surname>S.C.</surname>
          </string-name>
          :
          <article-title>An open graph visualization system and its applications to software engineering</article-title>
          .
          <source>Software. Practice and Experience</source>
          <volume>30</volume>
          (
          <issue>11</issue>
          ) (
          <year>2000</year>
          )
          <volume>1203</volume>
          {
          <fpage>1233</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          :
          <article-title>Veri cation of Work ow nets</article-title>
          .
          <source>In: ICATPN</source>
          . Vol.
          <volume>1248</volume>
          of LNCS., Springer (
          <year>1997</year>
          )
          <volume>407</volume>
          {
          <fpage>426</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <source>Business Process Management: Concepts</source>
          , Languages, Architectures, Second Edition. Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Tarjan</surname>
          </string-name>
          , R.E.:
          <article-title>Depth- rst search and linear graph algorithms</article-title>
          .
          <source>SIAMCOMP</source>
          <volume>1</volume>
          (
          <issue>2</issue>
          ) (
          <year>1972</year>
          )
          <volume>146</volume>
          {
          <fpage>160</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Behavioural Pro les: A Relational Approach to Behaviour Consistency</article-title>
          .
          <source>PhD thesis</source>
          , University of Potsdam (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Polyvyanyy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Structuring Process Models</article-title>
          .
          <source>PhD thesis</source>
          , University of Potsdam (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smirnov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiggert</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Flexab | exible business process model abstraction</article-title>
          .
          <source>In: CAiSE Forum</source>
          . Vol.
          <volume>734</volume>
          of CEUR Workshop Proceedings., CEUR-WS.org (
          <year>2011</year>
          )
          <volume>17</volume>
          {
          <fpage>24</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Overdick</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weske</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Oryx | an open modeling platform for the BPM community</article-title>
          .
          <source>In: BPM</source>
          . Vol.
          <volume>5240</volume>
          of LNCS., Springer (
          <year>2008</year>
          )
          <volume>382</volume>
          {
          <fpage>385</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lohmann</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolf</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>How to implement a theory of correctness in the area of business processes and services</article-title>
          .
          <source>In: BPM</source>
          . Vol.
          <volume>6336</volume>
          of LNCS., Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>