Decreasing the complexity of deriving test suites against nondeterministic finite state machines

Warning The system is temporarily closed to updates for reporting purpose.

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. (Request a copy)

Abstract

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.
Item Type: Papers in Conference Proceedings
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Hüsnü Yenigün
Date Deposited: 15 Feb 2018 14:49
Last Modified: 26 Apr 2022 09:29
URI: https://research.sabanciuniv.edu/id/eprint/34249

Actions (login required)

View Item
View Item