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

  • Husnu Yenigun
  • , Natalia Kushik
  • , Jorge Lopez
  • , Nina Yevtushenko
  • , Ana R. Cavalli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of 2017 IEEE East-West Design and Test Symposium, EWDTS 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538632994
DOIs
Publication statusPublished - 14 Nov 2017
Externally publishedYes
Event2017 IEEE East-West Design and Test Symposium, EWDTS 2017 - Novi Sad, Serbia
Duration: 27 Sept 20172 Oct 2017

Publication series

NameProceedings of 2017 IEEE East-West Design and Test Symposium, EWDTS 2017

Conference

Conference2017 IEEE East-West Design and Test Symposium, EWDTS 2017
Country/TerritorySerbia
CityNovi Sad
Period27/09/172/10/17

Keywords

  • (Nondeterministic) Finite State Machines (FSMs)
  • (adaptive) distinguishing sequences
  • projections
  • test suites

Fingerprint

Dive into the research topics of 'Decreasing the complexity of deriving test suites against nondeterministic finite state machines'. Together they form a unique fingerprint.

Cite this