A polynomial algorithm for testing diagnosability of discrete-event systems

By Shengbing Jiang, Zhongdong Huang, V. Chandra, Ratnesh Kumar. IEEE Transactions on Automatic Control, 2001

460 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0d3809a1959d7de3bf49f7cd58b284df353abfed

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Stéphane Lafortune
2. Janan Zaytoon

In Computer Networks and Communications

1. Stéphane Lafortune
2. Janan Zaytoon

Citations in the corpus

• Overview of fault diagnosis methods for Discrete Event Systems (2013, methodology): “To overcome the potential state explosion problem for off-line testing of diagnosability using diagnosers, the so-called ‘‘twin ma-chine’’ technique (Jiang, Huang, Chandra, & Kumar, 2001 Lafortune, 2002a) was introduced to provide a worst-case polynomial test in the number of states of the system…”