Skip to main navigation Skip to search Skip to main content

Event diagnosis of discrete-event systems with uniformly and nonuniformly bounded diagnosis delays

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

24 Scopus citations

Abstract

Various notions of diagnosability reported in literature deal with uniformly bounded finite detection or counting delays. The uniformity of delays can be relaxed while delays remain finite. We introduce various notions of diagnosability allowing nonuniformly bounded finite delays. A polynomial-time verification algorithm for diagnosability with nonuniformly bounded finite indefinite-counting delays is presented. A similar technique is applied to give a computationally better verification algorithm for diagnosability with uniformly bounded finite indefinite-counting delays than algorithms previously reported in literature. Finally we develop a new on-line diagnosis algorithm that has a lower time and space complexity than on-line diagnosis algorithms reported in literature for counting the occurrence of repeated/intermittant faults.

Original languageEnglish
Title of host publicationProceedings of the 2004 American Control Conference (AAC)
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5102-5107
Number of pages6
ISBN (Print)0780383354
DOIs
StatePublished - 2004
Event2004 American Control Conference, AAC 2004 - Boston, MA, United States
Duration: Jun 30 2004Jul 2 2004

Publication series

NameProceedings of the American Control Conference
Volume6
ISSN (Print)0743-1619

Conference

Conference2004 American Control Conference, AAC 2004
Country/TerritoryUnited States
CityBoston, MA
Period06/30/0407/2/04

Fingerprint

Dive into the research topics of 'Event diagnosis of discrete-event systems with uniformly and nonuniformly bounded diagnosis delays'. Together they form a unique fingerprint.

Cite this