Information Technology Reference
In-Depth Information
Section 4 presents an experimental evaluation of the approaches studied in this
paper. Section 5 discusses the related work and Section 6 concludes.
2 Preliminaries
This section defines the notion of process model used in this paper and formulates
the similarity metric used for comparing pairs of process models.
2.1 Process Model
A process model consists of a set of related tasks to achieve a certain practi-
cal goal. There are several available modeling notations including Event-driven
Process Chains (EPC)[3], Business Process Modeling Notation (BPMN)[4] and
PetriNet [5]. In this paper, we adopt an abstract view to represent process mod-
els from different notations. That a process model is expressed in a directed
attributed graph:
Let L be a set of labels. A process model can be defined as a graph G = (N,E,F)
where:
- N is the set of nodes
-
E ↂ N × N
, is the set of edges
-F:
N ₒ L
is a function that maps nodes to labels
Figure 1 represent four process models in the context of the definition. The
legends of Process(a)-(d) are listed in the attached file. They are derived from a
process model matching contest [6] and similar to each other for their function-
ality of describing the birth registration process. Originally these process models
are expressed in terms of PetriNet. To be simple, we only capture the active
components (i.e., the transitions) rather than the passive ones like places. Also
we omit the logical relationship and condition detection among the nodes.
Fig. 1.
Process (a)-(d)
