Worst-case diagnosis completeness in regular graphs under the PMC model (Articolo in rivista)

Type
Label
  • Worst-case diagnosis completeness in regular graphs under the PMC model (Articolo in rivista) (literal)
Anno
  • 2007-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/TC.2007.1052 (literal)
Alternative label
  • Caruso A.*; Chessa S.**; Maestrini P.** (2007)
    Worst-case diagnosis completeness in regular graphs under the PMC model
    in I.E.E.E. transactions on computers (Print); IEEE Computer Society, Loa Alamitos [CA] (Stati Uniti d'America)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Caruso A.*; Chessa S.**; Maestrini P.** (literal)
Pagina inizio
  • 917 (literal)
Pagina fine
  • 924 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 56 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: Ieee Transactions on Computers, vol. 56 (7) pp. 917 - 924. IEEE, 2007. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 8 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 7 (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Department of Mathematics, University of Salento Dipartimento di Informatica, Universit√† di Pisa - Istituto di Scienza e Tecnologie dell'Informazione - CNR (literal)
Titolo
  • Worst-case diagnosis completeness in regular graphs under the PMC model (literal)
Abstract
  • System-level diagnosis aims at the identification of faulty units in a system by the analysis of the system syndrome, that is, the outcomes of a set of interunit tests. For any given syndrome, it is possible to produce a correct (although possibly incomplete) diagnosis of the system if the number of faults is below a syndrome-dependent bound and the degree of diagnosis completeness, that is, the number of correctly diagnosed units, is also dependent on the actual syndrome . The worst-case diagnosis completeness is a syndrome-independent bound that represents the minimum number of units that the diagnosis algorithm correctly diagnoses for any syndrome. This paper provides a lower bound to the worst-case diagnosis completeness for regular graphs for which vertexisoperimetric inequalities are known and it shows how this bound can be applied to toroidal grids. These results prove a previous hypothesis about the influence of two topological parameters of the diagnostic graph, that is, the bisection width and the diameter, on the degree of diagnosis completeness (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Editore di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it