期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 47, 期 9, 页码 1491-1495出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2002.802763
关键词
computational complexity; diagnosability verification; discrete-event systems; failure diagnosis
The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据