摘要：AbstractThis paper addresses the modular diagnosability verification of discrete event system (DES). We assume that the language generated by each automaton module can have deadlocks and that the common events among modules are observable. A new algorithm is developed based on the proposition of a necessary and sufficient condition for modular diagnosability, whose complexity is polynomial and is lower than that of other approaches in literature.
