A new efficient and flexible algorithm for the design of testable subsystems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Applied Mathematics and Computer Science Année : 2010

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

Résumé

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.
Fichier principal
Vignette du fichier
amc20113.pdf (492.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00479477 , version 1 (30-04-2010)

Identifiants

  • HAL Id : hal-00479477 , version 1

Citer

Stéphane Ploix, Abed Alrahim Yassine, Jean-Marie Flaus. A new efficient and flexible algorithm for the design of testable subsystems. International Journal of Applied Mathematics and Computer Science, 2010, 20 (1), pp.175-190. ⟨hal-00479477⟩
150 Consultations
112 Téléchargements

Partager

Gmail Facebook X LinkedIn More