{"title":"增强比较模型下多处理机系统的可诊断性","authors":"Shiying Wang, Wei Feng","doi":"10.1016/j.tcs.2025.115534","DOIUrl":null,"url":null,"abstract":"<div><div>Diagnosability of a multiprocessor system <span><math><mi>G</mi></math></span> is a fundamental topic. The <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span> requires that every fault-free component in <span><math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math></span> has at least <span><math><mrow><mi>g</mi><mo>+</mo><mn>1</mn></mrow></math></span> vertices, while the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability requires that every fault-free vertex has at least <span><math><mi>g</mi></math></span> fault-free neighbors. In this paper, we first propose a new model, the <em>enhanced comparison</em> (EC) model on <span><math><mi>G</mi></math></span>, and establish the relationship between the <span><math><mi>g</mi></math></span>-extra diagnosability and the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>. Second, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-extra diagnosability of the hyper Petersen network. Finally, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of the star graph.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1057 ","pages":"Article 115534"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The diagnosability of multiprocessor systems under the enhanced comparison model\",\"authors\":\"Shiying Wang, Wei Feng\",\"doi\":\"10.1016/j.tcs.2025.115534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Diagnosability of a multiprocessor system <span><math><mi>G</mi></math></span> is a fundamental topic. The <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span> requires that every fault-free component in <span><math><mrow><mi>G</mi><mo>−</mo><mi>F</mi></mrow></math></span> has at least <span><math><mrow><mi>g</mi><mo>+</mo><mn>1</mn></mrow></math></span> vertices, while the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability requires that every fault-free vertex has at least <span><math><mi>g</mi></math></span> fault-free neighbors. In this paper, we first propose a new model, the <em>enhanced comparison</em> (EC) model on <span><math><mi>G</mi></math></span>, and establish the relationship between the <span><math><mi>g</mi></math></span>-extra diagnosability and the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>. Second, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-extra diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-extra diagnosability of the hyper Petersen network. Finally, we present and prove necessary and sufficient conditions for the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of <span><math><mi>G</mi></math></span>, and determine the <span><math><mi>g</mi></math></span>-good-neighbor diagnosability of the star graph.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1057 \",\"pages\":\"Article 115534\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397525004724\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525004724","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
The diagnosability of multiprocessor systems under the enhanced comparison model
Diagnosability of a multiprocessor system is a fundamental topic. The -extra diagnosability of requires that every fault-free component in has at least vertices, while the -good-neighbor diagnosability requires that every fault-free vertex has at least fault-free neighbors. In this paper, we first propose a new model, the enhanced comparison (EC) model on , and establish the relationship between the -extra diagnosability and the -good-neighbor diagnosability of . Second, we present and prove necessary and sufficient conditions for the -extra diagnosability of , and determine the -extra diagnosability of the hyper Petersen network. Finally, we present and prove necessary and sufficient conditions for the -good-neighbor diagnosability of , and determine the -good-neighbor diagnosability of the star graph.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.