Petri Net Synthesis from a Reachability Set

被引：0
|
作者：
Best, Eike [1 ]
Devillers, Raymond [2 ]
机构：
[1] Carl von Ossietzky Univ Oldenburg, Dept Comp Sci, D-26111 Oldenburg, Germany
[2] Univ Libre Bruxelles, Dept Informat, B-1050 Brussels, Belgium
来源：
APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2024 | 2024年 / 14628卷
关键词：
Petri Nets; Synthesis; Reachability Set; Net Classes; T-monotonicity;
D O I：
10.1007/978-3-031-61433-0_11
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Classical Petri net synthesis is a method to generate a Petri net from a labelled transition system. In this paper, by contrast, it is assumed that a (finite) set of markings is given, and an algorithm is described which generates a Petri net of some class having exactly this set as its reachability set. A notion of T-monotonicity simplifying the problem is introduced, but it is also shown that for some non-T-monotonic classes, the synthesis may nevertheless be solved algorithmically.
引用
收藏
页码：223 / 243
页数：21
相关论文
共 50 条
  • [1] DECIDABILITY OF THE PETRI NET REACHABILITY PROBLEM
    BUDINAS, BL
    AUTOMATION AND REMOTE CONTROL, 1988, 49 (11) : 1393 - 1422
  • [2] Lean Reachability Tree for Petri Net Analysis
    Li, Jun
    Yu, Xiaolong
    Zhou, MengChu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [3] A Sufficient Condition for Reachability in a General Petri Net
    Parthasarathy Ramachandran
    Manjunath Kamath
    Discrete Event Dynamic Systems, 2004, 14 : 251 - 266
  • [4] AN ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM
    MAYR, EW
    SIAM JOURNAL ON COMPUTING, 1984, 13 (03) : 441 - 460
  • [5] Lean Reachability Tree for Petri Net Analysis
    Li, Jun
    Yu, Xiaolong
    Zhou, Mengchu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [6] A sufficient condition for reachability in a general Petri net
    Ramachandran, P
    Kamath, M
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2004, 14 (03): : 251 - 266
  • [7] On reachability in autonomous continuous Petri net systems
    Júlvez, J
    Recalde, L
    Silva, M
    APPLICATIONS AND THEORY OF PETRI NETS 2003, PROCEEDINGS, 2003, 2679 : 221 - 240
  • [8] Synthesis of Petri net models: A rough set approach
    Pancerz, K
    Suraj, Z
    FUNDAMENTA INFORMATICAE, 2003, 55 (02) : 149 - 165
  • [9] Unfolding of Petri nets with semilinear reachability set
    Ohta, A
    Tsuji, K
    2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 4, PROCEEDINGS, 2004, : 501 - 504
  • [10] Extended Reachability Graph of Petri Net for Cost Estimation
    Davidrajuh, Reggie
    2013 8TH EUROSIM CONGRESS ON MODELLING AND SIMULATION (EUROSIM), 2013, : 378 - 383
12345