Exploitation of Flexibility in Sequential Networks - The Unknown Component Problem: Theory and Applications - page 232

111 1
.names v0 v1 v4 [2]
101 1
.names v0 v1 v4 v5 [3]
0010 1
.names v0 v4 v5 [4]
100 1
.names v0 v2 v4 [5]
011 1
.names v0 v2 v4 [6]
101 1
.names v0 v1 v2 [7]
001 1
.names v0 v1 v2 [8]
111 1
.names v1 v3 [9]
11 1
.names v0 v1 v5 [10]
101 1
.names v1 v5 [11]
11 1
.names [4] [7] [8] [12]
000 1
.names [2] [3] [5] [9] [10] [14]
00000 1
.names [0] [1] [3] [8] [16]
0000 1
.names [6] [7] [10] [11] [18]
0000 1
.names [0] [3] [4] [5] [6] [7] [8] [9] [10] [11] [20]
0000000000 1
.end
(b) Starting from the following FSM description of train11 in kiss format,
explore different encodings, and for each encoding apply the previous proce-
dure to compute a maximal sequential flexibility set:
.i 2
.o 1
.p 25
.s 11
00 st0 st0 0
10 st0 st1 -
01 st0 st2 -
10 st1 st1 1
00 st1 st3 1
11 st1 st5 1
01 st2 st2 1
00 st2 st7 1
11 st2 st9 1
00 st3 st3 1
01 st3 st4 1
01 st4 st4 1
00 st4 st0 -