
Test Generation from Finite-State Models
S0 S2S1
d/INIT(num, d)
d/ADD(num, d)
*/OUT(num)
(d|*)/ERROR( )
*/ERROR( )
Fig. 3.5 State diagram of a completely specified machine for converting a sequence
of one or more decimal digits to their decimal number equivalent. d|
∗
refers
to digit or any other character.
and M
1
= M
2
when they are distinguishable. Similarly, we write q
i
= q
j
when states q
i
and q
j
are equivalent, and q
i
= q
j
if they are distinguish-
able.
k-equivalence: Let M
1
= (X, Y, Q
1
, m
1
0
, T
1
, O
1
)andM
2
= (X, Y, Q
2
,
m
2
0
, T
2
, O
2
) be two FSMs. States q
t
∈ Q
1
and q
i
∈ Q
2
are considered
k-equivalent if when excited by any input of length k yield identical
output sequences ...