Information Technology Reference
In-Depth Information
Figure 3.9
Methods to reduce computation complexity.
p
2
2
t
d
, and all paths from
i
to
p
2
do not contain any conflict place.
Therefore, lack-of-synchronization is detected and we can conclude
that this
h
tuple does not yield any feasible solution.
3.5 CASE STUDY
Based on the proposed concepts and algorithms, we have developed a
prototype system called
DDSCS
(Data-Driven Service Composition
System) [90]. We take the AOPS example mentioned in Section 3.1 to
illustrate the validity of the proposed approach. The service portfolio
and data relations in AOPS are shown in Figure 3.10. For simplicity, we
omit the unrelated data/relations such that in the next step RSN equals
SN. The operation and mediation transitions are explained as follows:
mt
11
,
mt
12
: Mediation transition, to classify
order
into two subtypes:
ADSL order (
adsl_order
) and new-telephone-line order (
nl_order
).
t
2
: Operation transition, to search a corresponding worksheet
according to an order. The worksheet has to be already generated
before the search can return a meaningful result.
t
3
/t
4
: Operation transition, to generate a worksheet based on an
ADSL/new-telephone-line order.
