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 条

[31] Unbounded Petri net synthesis
Darondeau, P
LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 : 413 - 438
[32] PETRI NET REACHABILITY GRAPHS: DECIDABILITY STATUS OF FIRST-ORDER PROPERTIES
Darondeau, Philippe
Demri, Stephane
Meyer, Roland
Morvan, Christophe
LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (04)
[33] Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm
Jancar, Petr
INFORMATION AND COMPUTATION, 2008, 206 (11) : 1259 - 1263
[34] Analysis for reachability problem of bounded Petri net using key constraints method
Lan, Qianyi
Qin, Haisheng
Zhang, Xiaoling
2007 IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1-7, 2007, : 941 - 945
[35] A new approach to analyze the reachability of Petri net and its use in equipment support
Wang Yanlei
Chen Chunliang
Zhang Danyang
Proceedings of the First International Conference on Maintenance Engineering, 2006, : 941 - 945
[36] A Reachability-Decidable Petri Net Modeling Method for Discrete Event Systems
Su, Yue
Zhou, MengChu
Qi, Liang
Wisniewski, Remigiusz
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2025, 55 (01): : 453 - 464
[37] SYNTHESIS OF CONTROL-STRUCTURES FROM PETRI NET DESCRIPTIONS
PENG, Z
KUCHCINSKI, K
MICROPROCESSING AND MICROPROGRAMMING, 1986, 18 (1-5): : 335 - 340
[38] THE SYNTHESIS OF A PARALLEL CONTROLLER FROM A PETRI-NET MODEL
PARDEY, J
IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 22 : 73 - 89
[39] Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets
Lime, Didier
Roux, Olivier H.
Seidner, Charlotte
APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2019, 2019, 11522 : 406 - 425
[40] Process mining and Petri net synthesis
Kindler, Ekkart
Rubin, Vladimir
Schaefer, Wilhelm
BUSINESS PROCESS MANAGEMENT WORKSHOPS, 2006, 4103 : 105 - 116

← 1 2 3 4 5 →