Decreasing the complexity of deriving test suites against nondeterministic finite state machines
Yenigün, Hüsnü and Kushik, Natalia G. and López, Jorge H. and Yevtushenko, Nina V. and Cavalli, Ana Rosa (2017) Decreasing the complexity of deriving test suites against nondeterministic finite state machines. In: IEEE East-West Design and Test Symposium (EWDTS 2017), Novi Sad, Serbia
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/EWDTS.2017.8110091
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.
Repository Staff Only: item control page