Article

Test sequencing problems arising in test planning and design for testability

University of Connecticut, Storrs, Connecticut, United States
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans (Impact Factor: 2.18). 04/1999; 29(2):153 - 163. DOI: 10.1109/3468.747850
Source: DBLP

ABSTRACT

We consider four test sequencing problems that frequently arise in
test planning and design for testability (DFT) processes. Specifically,
we consider the following problems: (1) how to determine a test sequence
that does not depend on the failure probability distribution; (2) how to
determine a test sequence that minimizes expected testing cost while not
exceeding a given testing time; (3) how to determine a test sequence
that does not utilize more than a given number of tests, while
minimizing the average ambiguity group size; and (4) how to determine a
test sequence that minimizes the storage cost of tests in the diagnostic
strategy. We present various solution approaches to solve the above
problems and illustrate the usefulness of the proposed algorithms

Download full-text

Full-text

Available from: Krishna R. Pattipati, Jun 30, 2013
  • Source

    Full-text · Article ·
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we first present the formulation and solution of the basic test sequencing problem. We then consider generalized test sequencing problems that incorporate various practical features such as precedence constraints and setup operations for tests, multi-outcome tests, modular diagnosis, and rectification. We develop various AO<sup>* </sup> and information heuristic-based algorithms to solve these practical test sequencing problems. We also discuss the issues involved in implementation of the test sequencing algorithms for solving large problems efficiently, and show that our preprocessing techniques result in considerable speed-ups
    Full-text · Article · Feb 1999 · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the problem of constructing optimal and near-optimal test sequences for multiple fault diagnosis. The computational complexity of solving the optimal multiple-fault isolation problem is super exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and AND/OR graph search and by exploiting the single fault testing strategies of Pattipati et al. (1990), we present several test sequencing algorithms for the multiple fault isolation problem. These algorithms provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a diagnostic directed graph, instead of a traditional diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. The algorithms developed herein have been successfully applied to several real-world systems
    No preview · Article · Feb 2000 · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans
Show more