Polynomial time verification of decentralized diagnosability of discrete event systems

• Type: Article in International Scientific Journal
• Date: 2011

Authors

Moreira M. (Author) Other; Jesus T. (Author) Other; Basilio J. (Author) Other

Journal

Title: IEEE Transactions on Automatic Control

Vol. 56

Pages: 1679-1684

ISSN: 0018-9286

Publisher: IEEE

Indexing

Scopus - 132 Citations

Other information

Authenticus ID: P-00R-R4F

DOI: 10.1109/tac.2011.2124950

Abstract (EN): 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. © 2011 IEEE.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 5