Weak (approximate) detectability of labeled Petri net systems with inhibitor arcs

被引：9
作者：
Zhang, Kuize [1 ,2 ]
Giva, Alessandro [3 ]
机构：
[1] Harbin Engn Univ, Coll Automat, Harbin 150001, Heilongjiang, Peoples R China
[2] KTH Royal Inst Technol, Sch Elect Engn & Comp Sci, ACCESS Linnaeus Ctr, S-10044 Stockholm, Sweden
[3] Univ Cagliari, Dept Elect & Elect Engn, I-09123 Cagliari, Italy
来源：
IFAC PAPERSONLINE | 2018年 / 51卷 / 07期
基金：
瑞典研究理事会;
关键词：
Petri net with inhibitor arcs; weak detectability; weak approximate detectability; decidability; DISCRETE-EVENT SYSTEMS; OPACITY; OBSERVABILITY; VERIFICATION; COMPLEXITY;
D O I：
10.1016/j.ifacol.2018.06.296
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Weak (approximate) detectability of a labeled Petri net (LPN) system (with inhibitor arcs) is a property such that if the property is satisfied then there exists an infinite label sequence generated by the system such that all markings after a time step can determined (in a prescribed subset of reachable markings) by the label sequence. Specifically, we prove that the problems of deciding weak detectability of LPN systems with inhibitor arcs and weak approximate detectability of LPN systems are both undecidable. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码：167 / 171
页数：5
相关论文
共 21 条
  • [1] Opacity generalised to transition systems
    Bryans, Jeremy W.
    Koutny, Maciej
    Mazare, Laurent
    Ryan, Peter Y. A.
    [J]. INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2008, 7 (06) : 421 - 435
  • [2] Observability, Reconstructibility and State Observers of Boolean Control Networks
    Fornasini, Ettore
    Valcher, Maria Elena
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (06) : 1390 - 1401
  • [3] Observability of place/transition nets
    Giua, A
    Seatzu, C
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (09) : 1424 - 1437
  • [4] Hack M., 1976, TECHNICAL REPORT
  • [5] Overview of discrete event systems opacity: Models, validation, and quantification
    Jacob, Romain
    Lesage, Jean-Jacques
    Faure, Jean-Marc
    [J]. ANNUAL REVIEWS IN CONTROL, 2016, 41 : 135 - 146
  • [6] Detectability in stochastic discrete event systems
    Keroglou, Christoforos
    Hadjicostis, Christoforos N.
    [J]. SYSTEMS & CONTROL LETTERS, 2015, 84 : 21 - 26
  • [7] Masopust T., 2017, COMPLEXITY DECIDING
  • [8] Saboori A, 2007, IEEE DECIS CONTR P, P3101
  • [9] Current-State Opacity Formulations in Probabilistic Finite Automata
    Saboori, Anooshiravan
    Hadjicostis, Christoforos N.
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2014, 59 (01) : 120 - 133
  • [10] Verification of initial-state opacity in security applications of discrete event systems
    Saboori, Anooshiravan
    Hadjicostis, Christoforos N.
    [J]. INFORMATION SCIENCES, 2013, 246 : 115 - 132
123