An Efficient Algorithm for K-Diagnosability Analysis of Bounded and Unbounded Petri Nets

被引：0

作者：

Chouchane, A. ^{[1
]}

Ghazel, M. ^{[1
]}

机构：

[1] Univ Gustave Eiffel, COSYS ESTAS, Lille Campus, F-59650 Villeneuve Dascq, France

来源：

IFAC PAPERSONLINE | 2024年 / 58卷 / 01期

关键词：

K-diagnosability; bounded and unbounded labeled Petri nets; discrete event systems; linear optimization technique;

D O I：

10.1016/j.ifacol.2024.07.028

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we propose a polynomial algorithm for conducting K-diagnosability analysis on both bounded and unbounded labeled Petri nets. More specifically, we formulate a sufficient condition for K-diagnosability by addressing the relaxation (in R) of an Integer Linear Programming (ILP) problem defined on a compacted horizon. In addition, if the model is K-diagnosable, the technique provides a value K-relax, potentially lower than K, that ensures (K-relax-)diagnosability. To assess the performance and efficiency of the developed method, a Petri net model of a railway benchmark is investigated.

引用

页码：162 / 167

页数：6

共 50 条

[21] Diagnosability analysis based on T-invariants of Petri nets
Wen, YL
Jeng, M
2005 IEEE NETWORKING, SENSING AND CONTROL PROCEEDINGS, 2005, : 371 - 376
[22] Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters
Pommereau, Franck
Devillers, Raymond
Klaudel, Hanna
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 239 : 119 - 129
[23] Diagnosis and Diagnosability Analysis of Labeled Petri Nets Using Reduction Rules
Li, Ben
Khlif-Bouassida, Manel
Toguyeni, Armand
2016 13TH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS (WODES), 2016, : 171 - 176
[24] The t/k-Diagnosability and a t/k Diagnosis Algorithm of the Data Center Network BCCC Under the MM* Model
Lu, Jialiang
Zhao, Wei
Li, Jie
ALGORITHMS, 2022, 15 (12)
[25] An efficient algorithm for the transient analysis of a class of Deterministic Stochastic Petri nets
Gribaudo, M
Sereno, M
2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 835 - 844
[26] Prognosability Analysis and Enforcement of Bounded Labeled Petri Nets
Ran, Ning
Hao, Jinyuan
Seatzu, Carla
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2022, 67 (10) : 5541 - 5547
[27] A modified reachability tree approach to analysis of unbounded Petri nets
Wang, FY
Gao, YQ
Zhou, MC
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01): : 303 - 308
[28] Robust Diagnosability Analysis of Discrete Event Systems Using Labeled Petri Nets
Li, Shiqi
Uzam, Murat
Yin, Li
Zhong, Zhaofeng
Zheng, Li
Wu, Naiqi
IEEE ACCESS, 2021, 9 : 163504 - 163515
[29] Critical pairs based diagnosability analysis of timed fault in Time Petri Nets
Coquand, Camille
Subias, Audine
Pencole, Yannick
Lubat, Eric
IFAC PAPERSONLINE, 2022, 55 (28): : 297 - 302
[30] Reduction Rules for Diagnosability Analysis of Complex Systems Modeled by Labeled Petri Nets
Li, Ben
Khlif-Bouassida, Manel
Toguyeni, Armand
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2020, 17 (02) : 1061 - 1069

← 1 2 3 4 5 →