WEKO3
アイテム
On Diagnosabilities of Systems with Incomplete Test
https://ipsj.ixsq.nii.ac.jp/records/59877
https://ipsj.ixsq.nii.ac.jp/records/5987767bb1040-5585-4218-8302-778205f0fa81
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0801003.pdf (461.9 kB)
|
Copyright (c) 1985 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1985-03-31 | |||||||
| タイトル | ||||||||
| タイトル | On Diagnosabilities of Systems with Incomplete Test | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | On Diagnosabilities of Systems with Incomplete Test | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Dept. of Computer Science Faculty of Engineering Tokyo Institute of Technology | ||||||||
| 著者所属 | ||||||||
| Dept. of Computer Science Faculty of Engineering Tokyo Institute of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Dept. of Computer Science, Faculty of Engineering, Tokyo Institute of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Dept. of Computer Science, Faculty of Engineering, Tokyo Institute of Technology | ||||||||
| 著者名 |
Kiyoshi, Furuya
Yoshihiro, Tohma
× Kiyoshi, Furuya Yoshihiro, Tohma
|
|||||||
| 著者名(英) |
Kiyoshi, Furuya
Yoshihiro, Tohma
× Kiyoshi, Furuya Yoshihiro, Tohma
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Hakimi and Amin [2] gave necessary and sufficient conditions for identification of all faulty units in a system on the assumption that the tests are complete. We extend those theories to the case where even fault-free units may fail tests of faulty ones. We define a system to be (t r)-diagnosable if all faulty units can be identified from test outcomes provided the number of faulty units and that of test failures do not exceed t and r respectively. Similarly we define totally-・ﾍdiagnosability where ・ﾀrepresents the summation of them. We first give the necessary and sufficient condition for a system in which no two units test each other to be totally-・ﾍdiagnosable. Then we extend the analysis to general case and give the condition for a system on which no such restriction is placed to be (t r)-diagnosable. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Hakimi and Amin [2] gave necessary and sufficient conditions for identification of all faulty units in a system on the assumption that the tests are complete. We extend those theories to the case where even fault-free units may fail tests of faulty ones. We define a system to be (t,r)-diagnosable if all faulty units can be identified from test outcomes, provided the number of faulty units and that of test failures do not exceed t and r respectively. Similarly, we define totally-・ﾍdiagnosability, where ・ﾀrepresents the summation of them. We first give the necessary and sufficient condition for a system, in which no two units test each other, to be totally-・ﾍdiagnosable. Then, we extend the analysis to general case, and give the condition for a system, on which no such restriction is placed, to be (t,r)-diagnosable. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 8, 号 1, p. 24-27, 発行日 1985-03-31 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
