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

doi:10.3233/FI-2020-1985

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

Computer Science

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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 language	English
Pages (from-to)	181-188
Number of pages	8
Journal	Fundamenta Informaticae
Volume	177
Issue number	2
DOIs	https://doi.org/10.3233/FI-2020-1985
State	Published - 2020

Keywords

PMC model
diagnosability
system diagnosis

Access to Document

10.3233/FI-2020-1985

Cite this

@article{f0b48e941c7149b1a857209290ee5bb0,

title = "The Diagnosability of (K4 - \{e\})-free Graphs under the PMC Diagnosis Model",

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.",

keywords = "PMC model, diagnosability, system diagnosis",

author = "Lin, \{Cheng Kuan\} and Kung, \{Tzu Liang\} and Dajin Wang and Teng, \{Yuan Hsiang\} and Teng, \{Yuan Hsiang\}",

year = "2020",

doi = "10.3233/FI-2020-1985",

language = "English",

volume = "177",

pages = "181--188",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "SAGE Publications Ltd",

number = "2",

}

TY - JOUR

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

AU - Lin, Cheng Kuan

AU - Kung, Tzu Liang

AU - Wang, Dajin

AU - Teng, Yuan Hsiang

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - PMC model

KW - diagnosability

KW - system diagnosis

UR - https://www.scopus.com/pages/publications/85098329431

U2 - 10.3233/FI-2020-1985

DO - 10.3233/FI-2020-1985

M3 - Article

AN - SCOPUS:85098329431

SN - 0169-2968

VL - 177

SP - 181

EP - 188

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this