A test generation algorithm for systems modelled as non-deterministic FSMs
Hosam M. F. AboElFotoh, Osman Abou-Rabia, Hasan Ural · Software Engineering Journal · 1993
A variety of systems can be modelled as finite-state machines (FSM). Several formal methods have been proposed for testing the conformance of an implementation to a given FSM-based specification. However, all of these methods assume that the specification is modelled by a deterministic FSM. This paper presents an efficient algorithm that generates a set of adaptive all state-pair optimised distinguishing sequences for testing systems modelled as non-deterministic FSMs.