Journal of Hebei University(Natural Science Edition) ›› 2022, Vol. 42 ›› Issue (1): 8-15.DOI: 10.3969/j.issn.1000-1565.2022.01.002

Previous Articles     Next Articles

Diagnosability verification of bounded Petri nets

HAO Zhenming1,2, LI Chengwang1, ZHANG Chaoyan1, RAN Ning1,3   

  1. 1.College of Electronic Information Engineering, Hebei University, Baoding 071002, China; 2. Laboratory of IoT Technology, Hebei University, Baoding 071002, China; 3. Laboratory of Energy-Saving Technology, Hebei University, Baoding 071002, China
  • Received:2021-02-03 Published:2022-02-22

Abstract: It is important to study diagnosability verification method because it is the premise of designing fault diagnosis algorithm for discrete event system to satisfy the diagnosability. Deadlock-free after a fault is one of the common assumptions in the research field of diagnosability, which limits the application scope of diagnosability verification method. In this paper, we remove the assumption of deadlock-free after the occurrence of a fault. The concept and construction algorithm of the label reachability graph are proposed first. Then a new diagnosability verification algorithm is given to verify diagnosability of bounded Petri nets. Finally, an example is given to illustrate the calculation process of the algorithm.

Key words: discrete event system, Petri net, fault diagnosis, diagnosability

CLC Number: