Using distinguishing and UIO sequences together in a checking sequence

Abstract

If a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence D̄, then there are methods that make use of D̄ to construct checking sequences that are much shorter than the ones that would be constructed by using only the UIO sequences for M. The methods to applied when a distinguishing sequence exists, only make use of the distinguishing sequences. In this paper we show that, even if M has a distinguishing sequence D̄, the UIO sequences can still be used together with D̄ to construct shorter checking sequences. © IFIP International Federation for Information Processing 2006.