<!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>Managing Massive Business Process Models and Instances with Process Space</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Software, Tsinghua University</institution>
          ,
          <addr-line>Beijing 100084</addr-line>
          ,
          <country country="CN">P.R. China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>BPM techniques are becoming more widely used, and there are more and more business process models and instances emerging. In this demonstration, we show how to manage large scale of process models and instances with Process Space. Creating, importing, storing, indexing and querying of models and instances will be exhibited. Since online tools for managing massive process instances are very rare, we focus on showing our useful tool of exploring process instances.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The remainder of this paper is structured as follows. In Section 2 we study
related work, before we introduce the implementation of our work in Section 3.
The management of process instances is presented in Section 4. In Section 5, we
show our demonstration and conclude the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        BeehiveZ [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] BeehiveZ1 is a business process model management system
developed by Tsinghua University. It focuses on the kernel algorithms for model query,
index, generation, simulation, similarity measure and the evaluation of process
mining algorithms, etc. Four types of business process model indexes and queries
mentioned in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], including: (1) exact query based on structure, (2) similarity
query based on structure, (3) exact query based on behavior, (4) similarity query
based on behavior, are all supported by BeehiveZ.
      </p>
      <p>Nearly all the functions in BeehiveZ have been integrated and extended into
our new online tool Process Space.</p>
      <p>
        Oryx Oryx2 is a web-based editor for modeling business processes in various
languages like BPMN, EPC and Petri net. It is an open platform for developments
regarding process modeling. Oryx is a project of the University of Potsdam.
Some source codes of Oryx are modi ed and imported into Process Space.
Disco Disco3 is a stand-alone applications designed and developed by Fluxicon
for process mining and analysis on event logs. In the design of process execution
analysis module of Process Space, we get a lot of inspiration from chart display
methods in Disco. Compared to Disco, Process Space is an open web application
which can handle large scale event logs and supporting third-party plugins.
Business process model query There have already been several research
prototypes on business process model query. BPMN-Q [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is a graph-based query
language. WISE [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] is a work ow information search engine, where work ow
models are represented hierarchically. VisTrails [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] allows users to query
workows by example. BP-QL [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is based on an abstraction of the BPEL standard for
distributed environment and supports query by example. Yan [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] uses
featurebased similarity estimation to improve the e ciency of similarity search.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Implementation of Process Space</title>
      <p>Process Space is a Brower/Server application implemented in Java. As shown
in Figure 1, it includes four major modules, which are process model analyzer,
process monitor, process instance analyzer and process data repository. For space
limitation, we omit the detail description.</p>
      <sec id="sec-3-1">
        <title>1 https://code.google.com/p/beehivez/ 2 https://code.google.com/p/oryx-editor/ 3 http:// uxicon.com/disco/</title>
        <p>on event log, instance data is reconstructed and saved into database. We can
easily view and move event logs with a friendly interface.</p>
        <p>Querying instances Common instance querying examples are mainly based on
length of activites, time consuming of activities, activity categories and adjacent
activities. These four types of queries are all supported in Process Space.
{ Length of activities refers to the number of activities in a process instance.</p>
        <p>When a user wants to query instances whose length is equal to, or larger
than, or between some given values, this type of query would be used.
{ Time consuming of activities refers to the cost of time from the execution
of rst activity to last activity in an instance. This is helpful in situations
like querying instances completed within a given period of time.
{ Activity category index is designed to solve problems when a user is
interesting in instances containing speci c types of activities.
{ Adjacent activities refers to two activities whose execution is in sequential
order in a process instance. This type of query is ultilized to search instances
with a given sequential structure.</p>
        <p>In order to meet the requirement of user-de ned instance index, we have
designed third-party interfaces. Users can implement their own indexing
algorithms and upload them onto Process Space. Once uploaded algorithms have
been checked and granted, they will come into operation in the system.</p>
        <p>Process Space uses Lucene8, a Java-based indexing and search technology
developed by Apache, as indexing engine. Moreover, we use mongo-lucene9, a
MongoDB-backed lucene directory for a scalable real-time search, to save
indexing data into MongoDB and manage them with Lucene at the same time.</p>
        <p>We use large scale of auto-generated models and instances to test the
performance of index module. With the scale of models and instances enlarging, the
time of inserting, indexing and querying keeps increasing and maintains a linear
relationship with the scale, as shown in Figure 2. Experimental results show that
the index module has an excellent performance.</p>
      </sec>
      <sec id="sec-3-2">
        <title>8 http://lucene.apache.org/ 9 https://github.com/rstiller/mongo-lucene</title>
        <p>Process execution analysis and visualization display Like Disco,
Process Space implements three major types of process execution analysis, instance
overview, activity statistics and resource statistics. Line charts and pie charts
are the two types of methods to represent the analysis results.
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Demonstration</title>
      <p>What will be shown in the demo? We will demonstrate the usage of Process
Space and focus on the management of process instances, including importing
event log, instance overview, indexing and querying, and anaylsis. We will use
industrial event logs from di erent enterprises and massive arti cial event logs
as examples. Through the demonstration on the example event logs, we can see
the management of instances is very friendly and e cient and the query
performance is good with use of indexes.</p>
      <p>Signi cance in BPM area. This demonstration shows a process model and
instance management tool called Process Space and how to manage process
instances e ciently and e ectively with it. It is helpful for e cient management
and analysis of business process data.</p>
      <p>Acknowledgements. The work is supported by the National Science
Foundation of China (No.61472207 &amp; No.61003099), the Ministry of Education &amp;
China Mobile Research Foundation (MCM20123011) and the special fund for
innovation of Shandong, China No. 2013CXC30001.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Catriel</given-names>
            <surname>Beeri</surname>
          </string-name>
          , Anat Eyal, Simon Kamenkovich, and
          <string-name>
            <given-names>Tova</given-names>
            <surname>Milo</surname>
          </string-name>
          .
          <article-title>Querying business processes</article-title>
          .
          <source>In Proceedings of the 32nd international conference on Very large data bases</source>
          , pages
          <volume>343</volume>
          {
          <fpage>354</fpage>
          . VLDB Endowment,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Tao</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Jianmin</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Lijie</given-names>
            <surname>Wen</surname>
          </string-name>
          .
          <article-title>E ciently querying business process models with beehivez</article-title>
          .
          <source>In BPM (Demos)</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Sherif</given-names>
            <surname>Sakr</surname>
          </string-name>
          and
          <string-name>
            <given-names>Ahmed</given-names>
            <surname>Awad</surname>
          </string-name>
          .
          <article-title>A framework for querying graph-based business process models</article-title>
          .
          <source>In Proceedings of the 19th international conference on World wide web</source>
          , pages
          <volume>1297</volume>
          {
          <fpage>1300</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Carlos</surname>
            <given-names>E Scheidegger</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huy T Vo</surname>
          </string-name>
          , David Koop, and et al.
          <article-title>Querying and re-using work ows with vstrails</article-title>
          .
          <source>In Proceedings of the 2008 ACM SIGMOD international conference on Management of data</source>
          , pages
          <volume>1251</volume>
          {
          <fpage>1254</fpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Qihong</given-names>
            <surname>Shao</surname>
          </string-name>
          , Peng Sun, and
          <string-name>
            <given-names>Yi</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Wise: A work ow information search engine</article-title>
          .
          <source>In Data Engineering</source>
          ,
          <year>2009</year>
          . ICDE'09. IEEE 25th International Conference on, pages
          <volume>1491</volume>
          {
          <fpage>1494</fpage>
          . IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Boudewijn F van Dongen</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ana Karla A de Medeiros</surname>
          </string-name>
          , HMW Verbeek,
          <article-title>and</article-title>
          et al.
          <article-title>The prom framework: A new era in process mining tool support</article-title>
          .
          <source>In Applications and Theory of Petri Nets</source>
          <year>2005</year>
          , pages
          <fpage>444</fpage>
          {
          <fpage>454</fpage>
          . Springer,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Jianmin</surname>
            <given-names>Wang</given-names>
          </string-name>
          , Tao Jin,
          <article-title>Raymond K Wong,</article-title>
          and
          <string-name>
            <given-names>Lijie</given-names>
            <surname>Wen</surname>
          </string-name>
          .
          <article-title>Querying business process model repositories</article-title>
          .
          <source>World Wide Web</source>
          , pages
          <volume>1</volume>
          {
          <fpage>28</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Zhiqiang</given-names>
            <surname>Yan</surname>
          </string-name>
          , Remco Dijkman, and
          <string-name>
            <given-names>Paul</given-names>
            <surname>Grefen</surname>
          </string-name>
          .
          <article-title>Fast business process similarity search with feature-based similarity estimation</article-title>
          .
          <source>In On the Move to Meaningful Internet Systems: OTM</source>
          <year>2010</year>
          , pages
          <fpage>60</fpage>
          {
          <fpage>77</fpage>
          . Springer,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>