Computation of Sequential Flexibility in Netlists by Windowing - The Unknown Component Problem: Theory and Applications - page 181

.names [9] v6.0
01
.names [11] v6.1
01
.names [13] v6.2
01
.names [15] v6.3
01
.names v0 v1 v3 v5 [0]
0001 1
.names v1 v5 [1]
10 1
.names v0 v1 v3 [2]
001 1
.names v3 v4 [3]
11 1
.names v0 v5 [4]
00 1
.names v0 v1 v5 [5]
111 1
.names v0 v1 v5 [6]
101 1
.names v0 v3 v5 [7]
011 1
.names v3 v5 [8]
01 1
.names [0] [9]
01
.names [1] [2] [6] [7] [11]
0000 1
.names [0] [4] [5] [7] [13]
0000 1
.names [2] [5] [6] [8] [15]
0000 1
.names [3] [5] [6] [7] [8] [17]
00000 1
.end
(a) Decompose the network in all possible ways into two components assigning to
each part some of the latches and the related combinational logic. Treating the
whole network as a specification, and defining one of two components as the
fixed part and the other as the flexible part to redesign, solve the corresponding
language equation to compute the largest solution that represents the complete
sequential flexibility of the part under redesign.