[AISWorld] Call for Submissions: Process Model Matching Contest 2013

[Matthias Weidlich]

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

                       CALL FOR SUBMISSIONS

                Process Model Matching Contest 2013

                at the 4th International Workshop on
    Process Model Collections: Management and Reuse (PMC-MR'13)
                  Beijing, China, August 26, 2013

          http://processcollections.org/matching-contest

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Business process models play an important role for managing business
processes and are created, for instance, for requirements analysis,
communication, automation and compliance. In essence, a process model
defines a set of activities and dependencies for their execution.

Process model matching refers to the creation of an alignment between
process models, i.e., the creation of correspondences between their
activities. In recent years, many techniques building on process model
matching have been proposed. Examples include techniques for the
validation of a technical implementation of a business process against
a business-centered specification model, delta-analysis of process
implementations and a reference model, harmonization of process
variants, process model search, or clone detection. Inspired by the
field of schema matching and ontology alignment, this demand led to the
development of different techniques for process model matching. Yet,
these techniques are heuristics and, thus, their results are inherently
uncertain and need to be evaluated on a common basis. Currently,
however, the BPM community lacks established datasets and frameworks
for evaluation. This contest aims at addressing the need for effective
evaluation. Towards this end, the contest defines process model
matching problems, publishes datasets for these problems, and seeks
implementations that solve them.

The results of the contest will be summarized at the contest website,
presented at the 4th International Workshop on Process Model
Collections, and published in joint paper with successful participants
as part of the workshop proceedings.

-------------------
Matching Problems
-------------------

The contest includes two sets of process model matching problems.

 * University Admission Processes, process models that represent the
   admission processes of nine German universities.

 * Birth Registration Processes, process models that represent birth
   registration processes in Germany, Russia, South Africa, and the
   Netherlands.

The datasets and details on data formats can be found at the contest
homepage:

http://processcollections.org/matching-contest

-------------------
Participation
-------------------

In order to take part in the matching contest, participants are asked
to solve the given matching problems with their self-developed matching
technique. Further, to publish the results of the contest, there will
be a joint paper with participants as part of the workshop proceedings.
As input for the joint publication, all participants have to provide a
description of their matching technique. This description must be no
more than 2 pages long (excluding references, LNBIP formatting).

In sum, participants are required to prepare the following material and
submit it by email to the contest organizers till July 1.

 * For each pair of process models that should be matched (there are
   2×36 pairs overall) a file with the automatically identified
   correspondences must be provided.

 * For the self-developed matching technique, a description following
   must be provided.

Details on the data formats and a template for the description of the
matching technique can also be found at the contest homepage.

-------------------
Schedule
-------------------

 * Publication of datasets: May 15, 2013.
 * Submission deadline (results and description): July 1, 2013.
 * Workshop: August 26, 2013.

-------------------
Organizers
-------------------

 * Henrik Leopold, Humboldt Universitaet zu Berlin, Germany
 * Matthias Weidlich, Technion – Israel Institute of Technology, Israel