On the Decidability and Complexity of Diagnosability for Labeled Petri Nets

被引：51
|
作者：
Yin, Xiang [1 ]
Lafortune, Stephane [2 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[2] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
来源：
IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2017年 / 62卷 / 11期
基金：
美国国家科学基金会;
关键词：
Computational complexity; discrete event systems; fault diagnosis; model checking; Petri nets; DISCRETE-EVENT SYSTEMS; ONLINE FAULT-DIAGNOSIS; VERIFICATION; MODELS;
D O I：
10.1109/TAC.2017.2699278
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we investigate the decidability and complexity of the fault diagnosis problem in unbounded labeled Petri nets. First, we show that checking diagnosability for unbounded Petri nets is decidable. We present a new necessary and sufficient condition for diagnosability, which can be reduced to a model checking problem for unbounded Petri nets. Then, we show that checking diagnosability for unbounded Petri nets is EXPSPACE-complete. This complexity result is further extended to various subclasses of Petri nets. To the best of our knowledge, this is the first paper that establishes decidability and complexity results for diagnosability of unbounded Petri nets.
引用
收藏
页码：5931 / 5938
页数：8
相关论文
共 50 条
  • [1] On the Decidability and Complexity of Diagnosability for Labeled Petri Nets (vol 62, pg 5931, 2017)
    Yin, Xiang
    Lafortune, Stephane
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (04) : 1768 - 1768
  • [2] Qualitative Diagnosability of labeled Petri Nets revisited
    Haar, Stefan
    [J]. PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 1248 - 1253
  • [3] Marking diagnosability verification in labeled Petri nets
    Ma, Ziyue
    Yin, Xiang
    Li, Zhiwu
    [J]. AUTOMATICA, 2021, 131
  • [4] The Complexity of Diagnosability and Opacity Verification for Petri Nets
    Berard, Beatrice
    Haar, Stefan
    Schmitz, Sylvain
    Schwoon, Stefan
    [J]. APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2017, 2017, 10258 : 200 - 220
  • [5] The Complexity of Diagnosability and Opacity Verification for Petri Nets
    Berard, Beatrice
    Haar, Stefan
    Schmitz, Sylvain
    Schwoon, Stefan
    [J]. FUNDAMENTA INFORMATICAE, 2018, 161 (04) : 317 - 349
  • [6] Decidability and complexity of Petri nets with unordered data
    Rosa-Velardo, Fernando
    de Frutos-Escrig, David
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (34) : 4439 - 4451
  • [7] Diagnosability of fault patterns with labeled stochastic Petri nets
    Lefebvre, Dimitri
    Hadjicostis, Christoforos N.
    [J]. INFORMATION SCIENCES, 2022, 593 : 341 - 363
  • [8] Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
    Houssam-Eddine Gougam
    Yannick Pencolé
    Audine Subias
    [J]. Discrete Event Dynamic Systems, 2017, 27 : 143 - 180
  • [9] Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
    Gougam, Houssam-Eddine
    Pencole, Yannick
    Subias, Audine
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2017, 27 (01): : 143 - 180
  • [10] Divergence Properties of Labeled Petri Nets and Their Relevance for Diagnosability Analysis
    Giua, Alessandro
    Lafortune, Stephane
    Seatzu, Carla
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (07) : 3092 - 3097
12345