The Diagnosability of (K4 - {e})-free Graphs under the PMC Diagnosis Model

Cheng Kuan Lin, Tzu Liang Kung, Dajin Wang, Yuan Hsiang Teng, Yuan Hsiang Teng

Research output: Contribution to journalArticlepeer-review

Abstract

The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The PMC model is the test-based diagnosis with a processor performing the diagnosis by testing the neighboring processors via the links between them. In this paper, we discuss the diagnosability of a (K4 - {e})-free graph under the PMC model.

Original languageEnglish
Pages (from-to)181-188
Number of pages8
JournalFundamenta Informaticae
Volume177
Issue number2
DOIs
StatePublished - 2020

Keywords

  • diagnosability
  • PMC model
  • system diagnosis

Fingerprint Dive into the research topics of 'The Diagnosability of (K4 - {e})-free Graphs under the PMC Diagnosis Model'. Together they form a unique fingerprint.

Cite this