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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on automatic control Ročník 56; číslo 7; s. 1679 - 1684
Hlavní autoři:	Moreira, M. V., Jesus, T. C., Basilio, J. C.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.07.2011 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!