Decreasing the complexity of deriving test suites against nondeterministic finite state machines
Hüsnü Yenigün, Natalia Kushik, Jorge López, Nina Vladimirovna Yevtushenko, Ana Rosa Cavalli · 2017
The paper presents a Finite State Machine (FSM) based approach for deriving tests with reduced complexity, under the White Box testing assumption where all the faulty implementations are explicitly enumerated. The specification and implementation FSMs are assumed to be initialized, i.e., each possibly partial and (non-observable) nondeterministic FSM has a reliable reset. The proposed technique is illustrated by the application to a communication protocol.