A Note on Fault Diagnosis Algorithms

Details A Note on Fault Diagnosis Algorithms A Note on Fault Diagnosis Algorithms

2010-04-16

arxiv.org/abs/1004.2764v1

Computer Science

Logic in Computer Science

Note: This paper is an extended version of the paper published in the proceedings of CDC'09, 48th IEEE Conference on Decision

Scientific paper

In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\"uchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.

Affiliated with

Also associated with

No associations

Rating

A Note on Fault Diagnosis Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Note on Fault Diagnosis Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Fault Diagnosis Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623380