On algorithms for operative diagnosis of systems

Nageswara S.V. Rao, Jih sen Lin

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

Abstract

We consider systems whose fault propagation properties can be modeled as directed graphs where the nodes represent components, and the edges represent fault propagation between the components. Some of the components are equipped with alarms that ring in response to an abnormal condition. Let n be the number of nodes of the graph, and k be the number of alarms. We first consider the diagnosis problems. We deal with the problem of computing the set of all potential failure sources that correspond to a set of ringing alarms AR. For single faults, we present diagnosis algorithms in zero-time and non-zero-time systems.

Original languageEnglish
Title of host publicationACM Eighteenth Annual Computer Science Conference (CSC90)
PublisherPubl by ACM
Pages446
Number of pages1
ISBN (Print)0897913485
StatePublished - 1990
Externally publishedYes
EventCooperation 1990 ACM 18th Annual Computer Science Conference Proceedings - Washington, DC, USA
Duration: Feb 20 1990Feb 22 1990

Publication series

NameACM Eighteenth Annual Computer Science Conference (CSC90)

Conference

ConferenceCooperation 1990 ACM 18th Annual Computer Science Conference Proceedings
CityWashington, DC, USA
Period02/20/9002/22/90

Fingerprint

Dive into the research topics of 'On algorithms for operative diagnosis of systems'. Together they form a unique fingerprint.

Cite this