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

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

引用次数: 0

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

查看原文本刊更多论文

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

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

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

求助全文

约1分钟内获得全文求助全文

来源期刊

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

自引率

0.00%

发文量