河北大学学报(自然科学版) ›› 2022, Vol. 42 ›› Issue (1): 8-15.DOI: 10.3969/j.issn.1000-1565.2022.01.002

• • 上一篇    下一篇

一种有界Petri网的可诊断性验证方法

郝真鸣1,2, 李承旺1, 张超岩1, 冉宁1,3   

  • 收稿日期:2021-02-03 发布日期:2022-02-22
  • 通讯作者: 冉宁(1987—)
  • 作者简介:郝真鸣(1964—),男,山西寿阳人,河北大学正高级工程师,主要从事自动化控制、检测技术等研究.
    E-mail:hbdxhzm@163.com
  • 基金资助:
    国家自然科学基金资助项目(61903119);河北省自然科学基金资助项目(F2019201088;A2020201021);河北省高等学校科学技术研究项目(BJ2021008);河北省引进留学人员资助项目(C20190319);河北大学"一省一校"专项基金资助项目(801260201137)

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

摘要: 离散事件系统满足可诊断性是设计故障诊断算法的前提,因此研究可诊断性验证方法具有重要意义.故障发生后无死锁是研究可诊断性问题常见的假设之一,限制了可诊断性验证方法的应用范围.本文在去掉故障发生后无死锁假设的基础上,首先提出了标签可达图的概念和构建算法,其次提出了一种新的可诊断性验证算法来验证有界Petri网是否满足可诊断性.最后通过例子详细说明可诊断性验证算法的计算过程.

关键词: 离散事件系统, Petri网, 故障诊断, 可诊断性

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

中图分类号: