Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems
From MaRDI portal
Publication:4312414
DOI10.1137/S0097539790187539zbMath0822.68010OpenAlexW1987551112MaRDI QIDQ4312414
No author found.
Publication date: 8 November 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539790187539
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
Diagnosability of Two-Matching Composition Networks ⋮ Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model ⋮ The conditional diagnosability of shuffle-cubes ⋮ Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems ⋮ Conditional diagnosability of a class of matching composition networks under the comparison model ⋮ Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks
This page was built for publication: Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems
