Monolithic: This is the most naive approach possible.
This technique is based on building monolithic transition
relation. It is the conjunction of all latches transition
relation. If we use y to denote the next state vector,
s the present state vector, x the input
vector and delta() the next state function, we define the
trasition relation of i-th latch to be the function
Ti (x,s,y) = yi <=> delta(i)(x,s).
Then, for a FSM of n latches,
the monolhitic transition relation is:
T(x,s,y) = T1(x,s,y)*T2(x,s,y)* ... *Tn(x,s,y)
When the monolithic TR is built, the traversal algorithm is executed.
This method is suitable for circuits with less than 20 latches