Verifying the Precision of Diagnostic Algorithms

Diagnosis of discrete event systems requires to decide whether the system model allows for certain types of executions to take place. Because this problem is hard, incomplete yet faster algorithms may be needed. This however can lead to a loss of precision. This paper presents a method to decide whether precision is maintained by such incomplete algorithms. To this end we define the Simulation, which is a modification of the model that simulates how the algorithm works. We then use the twin plant method to decide whether diagnosability is maintained despite the imprecision of the diagnostic algorithm. We illustrate the benefits of this approach on two diagnostic algorithms, namely Independent-Windows Algorithms and Chronicle-based Diagnosis.

Authors

• Xingyu Su
• Alban Grastien

Keywords

No keywords are indexed for this paper.