Test sequencing problems arising in test planning and design for testability

Mathworks Inc., Natick, MA
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans (Impact Factor: 2.18). 04/1999; 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

  • [Show abstract] [Hide abstract]
    ABSTRACT: Automobile is one of the most widely distributed cyber-physical systems. Over the last few years, the electronic explosion in automotive vehicles has significantly increased the complexity, heterogeneity and interconnectedness of embedded systems. Although designed to sustain long life, systems degrade in performance due to gradual development of anomalies eventually leading to faults. In addition, system usage and operating conditions (e.g., weather, road surfaces, and environment) may lead to different failure modes that can affect the performance of vehicles. Advanced diagnosis and prognosis technologies are needed to quickly detect and isolate faults in network-embedded automotive systems so that proactive corrective maintenance actions can be taken to avoid failures and improve vehicle availability. This paper discusses an integrated diagnostic and prognostic framework, and applies it to two automotive systems, viz., a Regenerative Braking System (RBS) in hybrid electric vehicles and an Electric Power Generation and Storage (EPGS) system.
    IEEE ICNC 2013 International Workshop on Cyber-Physical Systems; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers the problem of selecting a set of residual generators for inclusion in a model-based diagnosis system, while fulfilling fault isolability requirements and minimizing the number of residual generators. Two novel algorithms for solving the selection problem are proposed. The first algorithm provides an exact solution fulfilling both requirements and is suitable for small problems. The second algorithm, which constitutes the main contribution, is suitable for large problems and provides an approximate solution by means of a greedy heuristic and by relaxing the minimal cardinality requirement. The foundation for the algorithms is a novel formulation of the selection problem which enables an efficient reduction of the search-space by taking into account realizability properties, with respect to the considered residual generation method. Both algorithms are general in the sense that they are aimed at supporting any computerized residual generation method. In a case study the greedy selection algorithm is successfully applied in an industrial sized automotive engine system.
    IEEE Transactions on Systems Man and Cybernetics 07/2013; 43(6):1354 - 1369.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose new formulations for the problem of test selection in the presence of imperfect tests in order to minimize the total costs of tests subject to lower bound constraints on fault detection and fault isolation. Our formulation allows tests to have multiple outcomes and delays caused by fault propagation, reporting, and transmission. Since the test selection problem is NP-hard even in the presence of perfect binary tests with no delays, we propose genetic algorithm (GA) and Lagrangian relaxation algorithm (LRA) to solve this problem. GA is a general approach for solving the problem with imperfect tests, including the scenarios with delayed and multiple test outcomes. The LRA is suitable for problems with perfect tests, including multiple outcomes. A key advantage of the LRA approach is that it provides an approximate duality gap, which is an upper bound measure of suboptimality of the solution. Our formulations and algorithms are tested on various real-world and simulated systems, and comparisons are made with previous test selection methods developed for perfect tests with no delays. The results show that our methods can efficiently solve the imperfect test selection problem. In addition, they have better performance (measured in terms of the number of tests used) than the methods in the literature for the perfect test selection cases. Finally, the GA has better computational efficiency than the LRA for all of the scenarios with perfect tests.
    Systems, Man, and Cybernetics: Systems, IEEE Transactions on. 11/2013; 43(6):1370-1384.

Full-text (2 Sources)

Available from
May 29, 2014