The Reachability Problem for Petri Nets is Not Primitive Recursive

被引：19
|
作者：
Leroux, Jerome [1 ]
机构：
[1] Univ Bordeaux, CNRS, Bordeaux INP, LaBRI,UMR 5800, F-33400 Talence, France
来源：
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021) | 2022年
关键词：
Petri nets; reachability; complexity; fast growing functions;
D O I：
10.1109/FOCS52979.2021.00121
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a way to lift up the Tower complexity lower bound of the reachability problem for Petri nets to match the Ackermannian upper bound closing a long standing open problem. We also prove that the reachability problem in dimension 17 is not elementary.
引用
收藏
页码：1241 / 1252
页数：12
相关论文
共 50 条
  • [1] A primitive recursive algorithm for the general Petri net reachability problem
    Bouziane, Z
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 130 - 136
  • [2] The Reachability Problem for Petri Nets Is Not Elementary
    Czerwinski, Wojciech
    Lasota, Slawomir
    Lazic, Ranko
    Leroux, Jerome
    Mazowiecki, Filip
    [J]. PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 24 - 33
  • [3] The Reachability Problem for Petri Nets Is Not Elementary
    Czerwinski, Wojciech
    Lasota, Slawomir
    Lazic, Ranko
    Leroux, Jerome
    Mazowiecki, Filip
    [J]. JOURNAL OF THE ACM, 2021, 68 (01)
  • [4] Solving the reachability problem of a class of Petri nets
    Jeng, MD
    Peng, MY
    [J]. ETFA '97 - 1997 IEEE 6TH INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION PROCEEDINGS, 1997, : 258 - 262
  • [5] SOME CONSEQUENCES OF THE DECIDABILITY OF THE REACHABILITY PROBLEM FOR PETRI NETS
    LAMBERT, JL
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 340 : 266 - 282
  • [6] Mathematical programming approach to the Petri nets reachability problem
    Bourdeaud'huy, Thomas
    Hanafi, Said
    Yim, Pascal
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (01) : 176 - 197
  • [7] Applying Hm Heuristics in Petri Nets Reachability Problem
    Kultz, Rene
    Kunzle, Luis Allan
    Silva, Fabiano
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2010, 2010, 6433 : 163 - 173
  • [8] On persistent reachability in Petri nets
    Barylska, Kamila
    Mikulski, Lukasz
    Ochmanski, Edward
    [J]. INFORMATION AND COMPUTATION, 2013, 223 : 67 - 77
  • [9] On reachability graphs of Petri nets
    Ye, XM
    Zhou, HT
    Song, XY
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2003, 29 (02) : 263 - 272
  • [10] Compositional reachability in petri nets
    Rathke, Julian
    Sobociński, Pawell
    Stephens, Owen
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8762 : 230 - 243
12345