In this paper, a new technique is proposed for generating a minimum-length synchronizable test sequence that can be applied in the distributed test architecture where both external synchronization and input/output operation costs are taken into consid...
In this paper, a new technique is proposed for generating a minimum-length synchronizable test sequence that can be applied in the distributed test architecture where both external synchronization and input/output operation costs are taken into consideration. The method defines a set of transformation rules that constructs a duplex digraph from a given finite state machine representation of a protocol specification such that a rural Chinese postman tour of the duplex digraph can be used to generate a minimum-length synchronizable test sequence using synchronizable distinguishing sequences as the state identification sequence for each state of the given finite state machine. This method provides an elegant solution to the synchronization problem that arises during the application of a predetermined test sequence in some protocol test architectures that utilize remote testers.