File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Lee, Jaiyong
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Test selection for a nondeterministic FSM
- Issued Date
- 2001-07
- Citation
- COMPUTER COMMUNICATIONS, v.24, no.12, pp.1213 - 1223
- Abstract
- 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. (C) 2001 Elsevier Science B.V. All rights reserved.
- Publisher
- ELSEVIER SCIENCE BV
- ISSN
- 0140-3664
- Keyword (Author)
- Nondeterministric Finite-State Machines, protocol conformance testing, software testing, minimal test length
- Keyword
- FINITE-STATE MACHINES, FAULT COVERAGE, GENERATION, MODELS
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.