Symbolic FSM Traversal Methods
State Transition Graph traversal algorithms for finite state machines have applications in the area of synthesis, test, and verification. Traditional methods that enumerate the state space of the machine explicitly cannot handle machines with a large number of states. The approaches presented in the previous chapter try to combine implicit input enumeration with implicit state-space enumeration. Unfortunately, in general, states can only be combined if they are equivalent and have uni-distant state codes. Also, the method of enumeration involves a depth-first search of the STG.
Unable to display preview. Download preview PDF.