Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems

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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 56; no. 7; pp. 1679 - 1684
Main Authors:	Moreira, M. V., Jesus, T. C., Basilio, J. C.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.07.2011 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Applied sciences Automata Automatic control Complexity Computation Computational complexity Computer science; control theory; systems Control theory. Systems Decentralized diagnosability verification Diagnosis Discrete event systems discrete-event systems (DES) Exact sciences and technology Failure failure diagnosis Modelling and identification Partitioning algorithms Polynomials Automaton Polynomial method Computational complexity Diagnosability Program verification Polynomial time discrete-event systems (DES) Decentralized system Automata failure diagnosis diagnosability verification Fault diagnostic Discrete event system
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!