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 条
  • [41] Costs analysis of stealthy attacks with bounded output synchronized Petri nets
    Ammour, Rabah
    Brenner, Leonardo
    Demongodin, Isabel
    Amari, Said
    Lefebvre, Dimitri
    2021 IEEE 17TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2021, : 799 - 804
  • [42] Efficient encoding schemes for symbolic analysis of Petri nets
    Pastor, E
    Cortadella, J
    DESIGN, AUTOMATION AND TEST IN EUROPE, PROCEEDINGS, 1998, : 790 - 795
  • [43] An efficient algorithm for the computation of Stubborn Sets of well formed Petri Nets
    Brgan, R
    Poitrenaud, D
    APPLICATION AND THEORY OF PETRI NETS 1995, 1995, 935 : 121 - 140
  • [44] An efficient algorithm for exploring state spaces of Petri nets with large capacities
    Hiraishi, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (11) : 2188 - 2195
  • [45] Fully Expanded Tree for Property Analysis of One-Place-Unbounded Petri Nets
    Ding, Zhijun
    Pan, Meiqin
    Yang, Ru
    Jiang, Changjun
    Zhou, MengChu
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2017, 47 (09): : 2574 - 2585
  • [46] Analysis of Behavioural Properties of Bounded Petri Nets With a Semi-Structural Approach
    Gu, Chao
    Li, Zhiwu
    Giua, Alessandro
    2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 4467 - 4472
  • [47] HIERARCHICAL REACHABILITY GRAPH OF BOUNDED PETRI NETS FOR CONCURRENT-SOFTWARE ANALYSIS
    NOTOMI, M
    MURATA, T
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (05) : 325 - 336
  • [48] Verification of K-step and infinite-step opacity of bounded labeled Petri nets
    Tong, Yin
    Lan, Hao
    Seatzu, Carla
    AUTOMATICA, 2022, 140
  • [49] Efficient Algorithm for Liveness/Safeness Analysis of Free-Choice Nets in A Petri Net Tool: HiPS
    Ide, Kazuto
    Wasaki, Katsumi
    2012 6TH INTERNATIONAL CONFERENCE ON NEW TRENDS IN INFORMATION SCIENCE, SERVICE SCIENCE AND DATA MINING (ISSDM2012), 2012, : 179 - 184
  • [50] Schedulability analysis decision algorithm of timing constraint Petri nets
    Li, Huifang
    Li, Renhou
    Weidianzixue yu Jisuanji/Microelectronics & Computer, 2000, 17 (01): : 18 - 21
12345