Page 110 - Intelligent Communication Systems
P. 110
92 INTELLIGENT COMMUNICATION SYSTEMS
FIGURE 9.10 Generated tree.
The problem is to determine a path connecting node A and node G. This is solved
as follows,
(1) Any nodes linked by directed paths from node A are detectable; node B
and node C are detected.
(2) In the same way, any nodes linked by directed paths from node B and
node C are detected.
(3) In this way, the nodes linked one to another without a cycle are detected.
(4) Then the tree structure shown in Figure 9.10 is obtained.
(5) All of the paths from node A to node G form the solution as follows.
A-*B-»D-*C^>G
A-*B-»D-»G
A ~» C -^ B -^ D -» G
A~*C-*G
9.4 EXAMPLE DESCRIPTION OF TELECOMMUNICATION
SERVICES
An example of a description of POTS is shown in Figure 9.11. The description of
POTS in the state space is shown in Figure 9.12.
The meaning of the predicates in Figures 9.9 and 9.10 is as follows.
