Minimum Length Synchronizing Sequences of Finite State Machine

@article{Rho1993MinimumLS,
  title={Minimum Length Synchronizing Sequences of Finite State Machine},
  author={June-Kyung Rho and Fabio Somenzi and Carl Pixley},
  journal={30th ACM/IEEE Design Automation Conference},
  year={1993},
  pages={463-468}
}
Computing synchronizing sequences is an important step in test generation for circuits without external reset [CJSP93]. An efficient heuristic algorithm has been recently proposed [PJH92]. However, the only algorithms known so far for the minimum-length synchronizing sequence have been applicable only to small finite state machines, because they required excessive enumeration. In this paper we present a new technique to calculate the minimum length synchronizing sequence of a finite state… CONTINUE READING

Similar Papers

Loading similar papers…