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 条

[31] Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking
Igawa, Nao
Yokogawa, Tomoyuki
Amasaki, Sousuke
Kondo, Masafumi
Sato, Yoichiro
Arimoto, Kazutami
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2020, E103D (03) : 702 - 705
[32] A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
David, Alexandre
Jacobsen, Lasse
Jacobsen, Morten
Srba, Jiri
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (102): : 125 - 140
[33] Comments on "A modified reachability tree approach to analysis of unbounded Petri nets"
Ru, Yu
Wu, Weitnin
Hadjicostis, Christoforos N.
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2006, 36 (05): : 1210 - 1210
[34] Efficient analysis of concurrent systems by Petri nets
Hiraishi, K
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1998, 81 (09): : 29 - 36
[35] Efficient Reachability Analysis for Time Petri Nets
Hadjidj, Rachid
Boucheneb, Hanifa
IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (08) : 1085 - 1099
[36] Efficient timing analysis of a class of Petri nets
Hulgaard, H
Burns, SM
COMPUTER AIDED VERIFICATION, 1995, 939 : 423 - 436
[37] On-the-fly Diagnosability Analysis of Labeled Petri Nets Using T-invariants
Li, Ben
Khlif-Bouassida, Manel
Toguyeni, Armand
IFAC PAPERSONLINE, 2015, 48 (07): : 64 - 70
[38] Design of observations graphs for partially observed Petri nets: application to the diagnosability analysis of DES
Lefebvre, D.
Leclercq, E.
Guerin, F.
2013 IEEE 52ND ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2013, : 6329 - 6334
[39] An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees
You, Dan
Wang, Shouguang
Wu, Wenhui
IEEE ACCESS, 2018, 6 : 43732 - 43742
[40] Analysis of strong and strong periodic detectability of bounded labeled Petri nets
Lan, Hao
Tong, Yin
Seatzu, Carla
NONLINEAR ANALYSIS-HYBRID SYSTEMS, 2021, 42

← 1 2 3 4 5 →