By Topic

Optimal and near-optimal test sequencing algorithms with realistic test models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
V. Raghavan ; Mathworks Inc., Natick, MA, USA ; M. Shakeri ; K. Pattipati

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* 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

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:29 ,  Issue: 1 )