Decreasing the complexity of deriving test suites against nondeterministic Finite State Machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Decreasing the complexity of deriving test suites against nondeterministic Finite State Machines

Résumé

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
Fichier non déposé

Dates et versions

hal-01669274 , version 1 (20-12-2017)

Identifiants

Citer

Husnu Yenigun, Natalia Kushik, Jorge Lopez, Nina Yevtushenko, Ana Rosa Cavalli. Decreasing the complexity of deriving test suites against nondeterministic Finite State Machines. EWDTS 2017 : 15th IEEE East-West Design & Test Symposium, Sep 2017, Novi Sad, Serbia. pp.1 - 4, ⟨10.1109/EWDTS.2017.8110091⟩. ⟨hal-01669274⟩
222 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More