Test Generation from Finite-State Models
S
i
and S
j
contain pairs of states to be distinguished. The column la-
beled x contains the distinguishing sequence for the pairs of states
to its left. The rightmost two columns in this table show the last
symbol output when input x is applied to state S
i
and S
j
, respec-
tively. For example, as we have seen earlier O(q
1
, baaa) = 1101.
Thus, in Table 3.2, we only show the 1 in the corresponding out-
put column. Note that each pair in the last two columns is differ-
ent, that is o(S
i
, x) = o(S
j
, x) in each row. From this table, we obtain
W ={a, aa, aaa, baaa}.
3.5.3 IDENTIFICATION SETS
Consider an FSM M = (X, Y, Q, q
0
, ‰, O) with symbols having their
usual meanings and |Q|=n. Assume that M is completely specified