Information Technology Reference
In-Depth Information
Table 4.3
A Comparison of Related Work on Service
Composition/Analysis
MO
AC
CM
MC
AM
CP
Ouyang et al. [55]
PN
Y
N
N
N
N
Hamadi and Benatallah [122]
PN
N
Y
N
N
N
Kongdenfha [50]
N/A
N
Y
Y
N
N
Brogi and Popescu [51]
YAWL
Y
Y
Y
N
N
Nezhad [52]
FSM
N
Y
Y
Y
N
Our approach
CPN
N
Y
Y
N
Y
work uses asynchronous semantics that is realistic in industrial service
composition.
The work in [47,49] provides various scenarios of mismatch
patterns in Web service composition. However, a comprehensive clas-
sification is missing. Some scenarios are presented with the correspond-
ing solutions. These solutions seem elementary (presented with natural
language) and are based on proprietary models. Hence, they can hardly
be used in practice.
Based on their previous work [49], Kongdenfha et al. [50] propose
the use of an aspect-oriented programming (AOP) approach to weave
adaptation solutions into the partially compatible services. The work in
[51] proposes a method to automatically generate a mediator between
two services. Nezhad et al. [52] also propose an automata-based method
to model the protocol of service interactions and to identify mismatches
automatically. They use a schema matchmaking technique to handle the
issue of message mapping, and propose some heuristic methods for
deadlock resolution between two services.
A comparative summary of previous efforts in this area is given in
Table 4.3. The columns of the table correspond to the following criteria
where Y means yes and N means no:
MO
indicates the formal model used, FSM for finite state machines,
PN for Petri nets, CPN for colored Petri nets, and YAWL for Yet
Another Workflow Language.
AC
indicates whether the formalism provides a representation of
advancedBPEL constructs, for example, event handler, fault handler,
and scope.
