Have a personal or library account? Click to login
A new efficient and flexible algorithm for the design of testable subsystems Cover

A new efficient and flexible algorithm for the design of testable subsystems

Open Access
|Mar 2010

Abstract

In complex industrial plants, there are usually many sensors and the modeling of plants leads to lots of mathematical relations. This paper presents a general method for finding all the possible testable subsystems, i.e., sets of relations that can lead to various types of detection tests. This method, which is based on structural analysis, provides the constraints that have to be used for the design of each detection test and manages situations where constraints contain non-deductible variables and where some constraints cannot be gathered in the same test. Thanks to these results, it becomes possible to select the most interesting testable subsystems regarding detectability and diagnosability criteria. Application examples dealing with a road network, a digital counter and an electronic circuit are presented.

DOI: https://doi.org/10.2478/v10006-010-0013-7 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 175 - 190
Published on: Mar 25, 2010
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2010 Stéphane Ploix, Abed Yassine, Jean-Marie Flaus, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 20 (2010): Issue 1 (March 2010)