Test selection for a nondeterministic FSM

I. Hwang, T. Kim, S. Hong, J. Lee

Research output: Contribution to journalArticle

20 Citations (Scopus)


In testing Nondeterministic Finite State Machines (NFSMs), testing process becomes hypothesis testing, if test sequence repetition numbers are not large enough to satisfy the so-called complete-testing assumption. In this paper, we present a method to determine the repetition numbers of test sequences assuming that each transition is executed with a fixed probability when nondeterministic choice is made. The proposed method ensures the test pass probability of restricted class of faulty machines to be never greater than a given value. Also, we discuss how to select a test suite for NFSMs that guarantees the minimal total test length.

Original languageEnglish
Pages (from-to)1213-1223
Number of pages11
JournalComputer Communications
Issue number12
Publication statusPublished - 2001 Jul 15

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Test selection for a nondeterministic FSM'. Together they form a unique fingerprint.

  • Cite this