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 条
  • [41] Complexity of Distributed Petri Net Synthesis
    Devillers, Raymond
    Tredup, Ronny
    THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, TASE 2022, 2022, 13299 : 15 - 28
  • [42] Analysis of properties of Petri synthesis net
    Xia, Chuanliang
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 576 - 587
  • [43] Relevant Timed Schedules Clock Valuations for Constructing Time Petri Net Reachability Graphs
    Boucheneb, Hanifa
    Barkaoui, Kamel
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2008, 5215 : 265 - +
  • [44] STP-based approach to modeling and reachability analysis of a class of petri net systems
    Han X.-G.
    Chen Z.-Q.
    Zhang K.-Z.
    Liu Z.-X.
    Zhang Q.
    1600, Beijing University of Posts and Telecommunications (39): : 72 - 76
  • [45] Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs
    Boucheneb, Hanifa
    Barkaoui, Kamel
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2011, 21 (02): : 171 - 204
  • [46] Proof by model: a new knowledge-based reachability analysis methodology for Petri net
    Chao, Daniel Yuh
    Chi, Yen-Ping
    Yu, Tsung-Hsien
    Yu, Li-Chih
    Lee, Mike Y. J.
    IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 2017, 34 (04) : 1277 - 1298
  • [47] Accelerating Reachability Analysis on Petri Net for Mutual Exclusion-Based Deadlock Detection
    Du, Yunkai
    Gu, Naijie
    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2015, : 75 - 81
  • [48] Accelerating Reachability Analysis on Petri Net for Mutual Exclusion-Based Deadlock Detection
    Du, Yunkai
    Gu, Naijie
    Zhou, Xin
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D (12): : 2978 - 2985
  • [49] Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs
    Hanifa Boucheneb
    Kamel Barkaoui
    Discrete Event Dynamic Systems, 2011, 21 : 171 - 204
  • [50] Modules of Petri nets and new Petri net structure: Arcs with a weighted function set
    Zhu, Rongming
    Ban, Qing
    Cong, Xuya
    ADVANCES IN MECHANICAL ENGINEERING, 2019, 11 (03)
12345