Information Technology Reference
In-Depth Information
Figure 4.9
(a) An example in which no mediator exists. (b) The composed service.
(c) The CRG.
The following two lemmas are due to Reference [117].
Lemma 4.1.
ð
;
Þ
,
while the reduced state space generated by stubborn sets is a labeled
directed graph
ð
_W
The ordinary state space is a labeled directed graph
W
E
;
E
Þ
.
2
W
and s is a terminal state
If s
2
W and s is a terminal state, then s
of _
W
.
If s is a terminal state of
W
,thens
2
W and s is a terminal state
of W.
Lemma4.2.
There is an infiniteoccurrence sequence in the reducedstate
space if and only if there is an infinite occurrence sequence in the ordinary
state space.
