Information Technology Reference
In-Depth Information
The other is a mediation edge, that is,
t
M
ð
m
Þ
m
0
m
0
m
0
2
E
M
¼
h
m
;
t
M
ð
m
Þ;
ij
m
;
V andm
!
A mediation edge is constructed to act as a communication
mechanism between two services. The meaning of t
M
ð
m
Þ
is given in
Algorithm 4.1.
Algorithm 4.1. (Method to Construct CRG)
Input:
SWF-nets N
i
¼ð
P
Ii
[
P
Mi
;
T
i
;
F
i
; S
i
;
C
i
Þ
, i
¼
1, 2 and data map-
ping I.
The data mapping table used here is similar to Table 4.2, except that
a new column named flag is added.
Flag
Source
Target
SrcMsg_1.Element_1
TargetMsg_1.Element_1
...
...
SrcMsg.Element_n
TargetMsg.Element_n
Output: Gð
N
1
;
N
2
;
I
Þ¼ð
V
;
E
Þ
1.
m
20
g;
1
Þ
;
m
0
is untagged
2. While there are untagged nodes in V,do
2.1 Select an untagged node m
Initialize
ð
V
;
E
Þ¼ðf
m
0
¼
m
10
2
V and tag it; Denote
m
2
.
2.2 For each enabled transition, t
i
m
¼
m
1
2
T
i
,atm
¼
m
1
m
2
,do
t
i
2.2.1 Compute m
0
m
0
;fi
such
that m
!
¼
1,
m
0
¼
m
0
2, m
0
¼
m
0
m
2
; else if i
¼
m
1
s
m
0
, m
00
2.2.2 If there exists m
00
such that m
00
!
m
0
^
m
00
m
0
, and
6¼
9
p
2
P
^
p
2
P
M1
[
P
M2
such that
m
00
ð
, then the algorithm fails and exits
(Note that the unboundedness condition of CRG
has been detected.)
p
Þ <
m
ð
p
Þ
