TY - JOUR
T1 - Test selection for a nondeterministic FSM
AU - Hwang, I.
AU - Kim, T.
AU - Hong, S.
AU - Lee, J.
N1 - Copyright:
Copyright 2007 Elsevier B.V., All rights reserved.
PY - 2001/7/15
Y1 - 2001/7/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0035879462&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035879462&partnerID=8YFLogxK
U2 - 10.1016/S0140-3664(00)00327-3
DO - 10.1016/S0140-3664(00)00327-3
M3 - Article
AN - SCOPUS:0035879462
VL - 24
SP - 1213
EP - 1223
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
IS - 12
ER -