Journal of Jilin University Science Edition

Previous Articles     Next Articles

Algorithm of Safe Diagnosability for Distributed Discrete Event Systems

OUYANG Dantong1, LUO Zhiyu1, GENG Xuena2, ZHANG Liming1   

  1. 1. Symbol Computation and Knowledge Engineering of Ministry of Education,College of Computer Science and Technology, Jilin University, Changchun 130012, China; 2. School of Computer Science and Technology,Changchun University of Science and Technology, Changchun 130022, China
  • Received:2017-12-11 Online:2018-05-26 Published:2018-05-18
  • Contact: ZHANG Liming E-mail:limingzhang@jlu.edu.com

Abstract: The finite state automata was used to model distributed discrete event systems, then we proposed an  algorithm of safe diagnosability for distributed discrete event systems. First, we got the global model of the system, pruning and determining whether the given system could be diagnosed or not. If the system could be diagnosed,  the safediagnostor of the system was constructed. Then the safe labels were added to the global model to determine whether the system was safe diagnosable or not. The experimental results show that the algorithm can judge whether the distributed discrete event system is safe diagnosable or not, and the solution space is reduced. The state numbers are approximately reduced by 7 times in the best case, and the state numbers are approximately reduced by 5.45 times in the average case.

Key words: fault diagnosis, distributed discrete event system, safe, diagnostor

CLC Number: 

  • TP301.6