Deriving Exhaustive Test Suits for Nondeterministic FSMs w.r.t. Non-separability Relation

In this paper we consider test suite derivation for nondeterministic Finite State Machines (FSM) w. r. t. the non-separability relation. The improvement to the existing algorithms is proposed for exhaustive test derivation without the explicit enumeration of all possible implementations. One algorithm can be applied when the set of possible implementations is the set of all complete nondeterministic submachines of a given mutation machine. Another algorithm is applied when only the upper bound on the number of states of an IUT is known. As usual, when executing such test suites against an implementation FSM the requirement of "all weather conditions" is not needed.