期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 56, 期 7, 页码 1679-1684出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2011.2124950
关键词
Automata; computational complexity; diagnosability verification; discrete-event systems (DES); failure diagnosis
资金
- Brazilian Research Council (CNPq)
The first step in the diagnosis of failure occurrences in discrete event systems is the verification of the system diagnosability. Several works have addressed this problem using either diagnosers or verifiers for both centralized and decentralized architectures. In this technical note, we propose a new algorithm to verify decentralized diagnosability of discrete event systems. The proposed algorithm requires polynomial time in the number of states and events of the system and has lower computational complexity than all other methods found in the literature. In addition, it can also be applied to the centralized case.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据