Characterization of Connection Assignment of Diagnosable Systems

Hakimi, S. L.; Amin, Ashok T.

doi:10.1109/t-c.1974.223782

Cited by 373 publications

(83 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hakimi and Amin [8] characterized one-step t-diagnosable systems as follows: Theorem 2.1 (Hakimi and Amin [8]). A system S is one-step t-diagnosable if and only if 1) n !…”

Section: The Pmc Model and Some Preliminariesmentioning

confidence: 99%

(t, k)-diagnosable system: a generalization of the pmc models

Araki

Shibata

2003

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-In this paper, we introduce a new model for diagnosable systems called ðt; kÞ-diagnosable system which guarantees that at least k faulty units (processors) in a system are detected provided that the number of faulty units does not exceed t. This system includes classical one-step diagnosable systems and sequentially diagnosable systems. We prove a necessary and sufficient condition for ðt; kÞ-diagnosable system, and discuss a lower bound for diagnosability. Finally, we deal with a relation between ðt; kÞ-diagnosability and diagnosability of classical basic models.

show abstract

“…Hakimi and Amin [8] characterized one-step t-diagnosable systems as follows: Theorem 2.1 (Hakimi and Amin [8]). A system S is one-step t-diagnosable if and only if 1) n !…”

Section: The Pmc Model and Some Preliminariesmentioning

confidence: 99%

(t, k)-diagnosable system: a generalization of the pmc models

Araki

Shibata

2003

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…This algorithm premises that it does not trust the test result if the testing unit is out of order and each unit does not test itself. As another self-diagnosable algorithm, t-fault one-step diagnosable system (Hakimi & Amin, 1974;Kohda, 1994) is proposed that can detect simultaneously multiple faults of up to t among n units from mutual diagnostic results of the system (hereinafter referred to as t-OD system).…”

Section: T-fault One-step Diagnosable Systemmentioning

confidence: 99%

A Dependable Multi-Agent System with Self-Diagnosable Function

Matsumoto¹,

Tanimoto²,

Mori³

2011

Multi-Agent Systems - Modeling, Interactions, Simulations and Case Studies

View full text Add to dashboard Cite

“…And a system is / -diagnosable if and only if all faulty nodes can be isolated within a set of sizes at most in the presence of at most faulty nodes. Under the PMC model, Hakimi and Amim [18] characterized -diagnosable systems and [19,20] characterized / -diagnosable systems. Under the comparison model, Sengupta and Dahbura [11] proposed a characterization ofdiagnosable systems.…”

Section: Introductionmentioning

confidence: 99%

On Fault Identification in Interconnection Networks under the Comparison Model

Liang

Zhang

2018

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

We propose three characterization theorems of / -diagnosable systems under the comparison model. By these characterization theorems we present some properties of / -diagnosable systems. Furthermore, for a given network system, we introduce a new method to determine a range from min to max conveniently, in which the system is at least min / min -diagnosable and at most max / max -diagnosable. By applying our results to some well-known networks such as -dimensional hypercube, 2 (3 ) mesh, and permutation star graph, we figure out their / -diagnosability.

show abstract

Characterization of Connection Assignment of Diagnosable Systems

Cited by 373 publications

References 3 publications

(t, k)-diagnosable system: a generalization of the pmc models

(t, k)-diagnosable system: a generalization of the pmc models

A Dependable Multi-Agent System with Self-Diagnosable Function

On Fault Identification in Interconnection Networks under the Comparison Model

Contact Info

Product

Resources

About