Information Technology Reference
In-Depth Information
R
i
¼
N
R
ForEach
p
n
2
P
C
ForEach
t
k
s.t.
t
k
2
p
n
^:
Q
h
ð
p
n
Þ
t
k
M(
p
n
,
t
k
,
p
nk
,
.
R
i
)
EndFor
EndFor
While (
9
s
2
P
i
s.t. S(
s
)
^:
D
S
(
s
))
t
¼
s
If
t
¼f
s
g
D(
s
,
R
i
)
D(
t
,
R
i
)
ElseIf
t
f
s
g^9
s
0
2
t
f
s
g
s.t.
:
D
S
ð
s
0
Þ
Mark
s
as
dead
ElseIf
t
f
s
g^8
s
0
2
t
f
s
g)
D
S
ð
s
0
Þ
D(
t
,
R
i
)
D(
t
,
R
i
)
EndIf
ForEach
p
m
2
P
i
s.t. S(
p
m
)
^j
p
m
j>
1
ForEach
t
j
2
p
m
M(
p
m
,
t
j
,
p
mj
,
R
i
)
EndFor
EndFor
EndWhile
The decomposition algorithm is intuitively explained as follows.
For each conflict place, it removes all the unwanted branches according
to a given selection tuple. First, for each conflict place, the branches not
selected are isolated (the first
ForEach
procedure). Afterwards, all the
source places in the net are examined; they are deleted with their
succeeding transitions or marked as
dead
, until no new node can be
removed/marked (the
While
procedure).
3.4 EFFECTIVENESS AND EFFICIENCY OF THE
DATA-DRIVEN APPROACH
3.4.1 Solution Effectiveness
Theorem 3.1. (Solution Effectiveness)
Given a service net N
S
and a
requirement I
!
O, if there is a feasible solution
with respect to
require-
ment I
!
O, the decomposition algorithm can find it.
