在Malek比较模型中确定顺序可诊断性数的复杂性

Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS) Pub Date : 1993-11-16 DOI:10.1109/ATS.1993.398801

Zhou Liuding, Y. Xiaofan, Chen Tinghuai, Tang Chen-li

{"title":"在Malek比较模型中确定顺序可诊断性数的复杂性","authors":"Zhou Liuding, Y. Xiaofan, Chen Tinghuai, Tang Chen-li","doi":"10.1109/ATS.1993.398801","DOIUrl":null,"url":null,"abstract":"The problem of determining the sequential diagnosability number of a system in the Malek's comparison model is an important one. In this paper, we show that the decision version of this problem is co-NP complete for general systems, and we present an O(|E| |V|/sup 3/2/ log /sub 2/(|V|)) algorithm for determining the sequential diagnosability number for a class of systems corresponding to bipartite graphs.<<ETX>>","PeriodicalId":228291,"journal":{"name":"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)","volume":"32 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The complexity of determining the sequential diagnosability number in the Malek's comparison model\",\"authors\":\"Zhou Liuding, Y. Xiaofan, Chen Tinghuai, Tang Chen-li\",\"doi\":\"10.1109/ATS.1993.398801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of determining the sequential diagnosability number of a system in the Malek's comparison model is an important one. In this paper, we show that the decision version of this problem is co-NP complete for general systems, and we present an O(|E| |V|/sup 3/2/ log /sub 2/(|V|)) algorithm for determining the sequential diagnosability number for a class of systems corresponding to bipartite graphs.<<ETX>>\",\"PeriodicalId\":228291,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)\",\"volume\":\"32 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATS.1993.398801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.1993.398801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在Malek比较模型中，确定系统的顺序可诊断数是一个重要的问题。在本文中，我们证明了该问题的决策版本对于一般系统是协np完全的，并给出了一个O(|E| |V|/sup 3/2/ log /sub 2/(|V|))算法来确定一类对应于二部图的系统的顺序可诊断性数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The complexity of determining the sequential diagnosability number in the Malek's comparison model

The problem of determining the sequential diagnosability number of a system in the Malek's comparison model is an important one. In this paper, we show that the decision version of this problem is co-NP complete for general systems, and we present an O(|E| |V|/sup 3/2/ log /sub 2/(|V|)) algorithm for determining the sequential diagnosability number for a class of systems corresponding to bipartite graphs.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)

自引率

0.00%

发文量