Location of Repository

A Polynomial Algorithm for Testing Diagnosability of Discrete Event Systems

By Shengbing Jiang, Zhongdong Huang, Vigyan Chandra and Ratnesh Kumar

Abstract

Failure diagnosis in large and complex systems is a critical task. In the realm of discrete event systems, Sampath et al. proposed a language based failure diagnosis approach. They introduced the diagnosability for discrete event systems and gave a method for testing the diagnosability by rst constructing a diagnoser for the system. The complexity of this method of testing diagnosability is exponential in the number of states of the system and doubly exponential in the number of failure types. In this paper, we give an algorithm for testing diagnosability that does not construct a diagnoser for the system, and its complexity is polynomial in the number of states of the system and exponential in the number of failure types

Topics: Discrete event system, failure diagnosis, diagnosability, complexity
Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.7879
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.engr.uky.edu/~kumar... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.