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 条

[21] Approximating Petri Net Reachability Along Context-free Traces
Atig, Mohamed Faouzi
Ganty, Pierre
IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 152 - 163
[22] Classifications of Petri net transitions and their application to firing sequence and reachability problems
Huang, JS
Murata, T
SMC '97 CONFERENCE PROCEEDINGS - 1997 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: CONFERENCE THEME: COMPUTATIONAL CYBERNETICS AND SIMULATION, 1997, : 263 - 268
[23] Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
Amat, Nicolas
Dal Zilio, Silvano
Le Botlan, Didier
VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2024, PT I, 2024, 14499 : 101 - 123
[24] Parallel computation of the reachability graph of petri net models with semantic information
de Murillas, Eduardo Gonzalez-Lopez
Fabra, Javier
Alvarez, Pedro
Ezpeleta, Joaquin
SOFTWARE-PRACTICE & EXPERIENCE, 2017, 47 (05): : 647 - 668
[25] A New Approach to Analyze the Reachability of Petri Net and Its Use in Maintenance
Fang, Hualing
Dong, Chuandai
PROCEEDINGS OF 2009 8TH INTERNATIONAL CONFERENCE ON RELIABILITY, MAINTAINABILITY AND SAFETY, VOLS I AND II: HIGHLY RELIABLE, EASY TO MAINTAIN AND READY TO SUPPORT, 2009, : 630 - +
[26] A slicing-based approach to enhance Petri net reachability analysis
Lee, WJ
Kim, HN
Cha, SD
Kwon, YR
JOURNAL OF RESEARCH AND PRACTICE IN INFORMATION TECHNOLOGY, 2000, 32 (02): : 131 - 143
[27] Reachability set generation for Petri nets: Can brute force be smart?
Ciardo, G
APPLICATIONS AND THEORY OF PETRI NETS 2004, PROCEEDINGS, 2004, 3099 : 17 - 34
[28] Simultaneous Petri Net Synthesis
Best, Eike
Devillers, Raymond
Schlachter, Uli
Wimmel, Harro
SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2018, 28 (02) : 199 - 236
[29] TRANSFORMATION ALGORITHM FROM AN ALTERNATIVES AGGREGATION PETRI NET TO A COMPOUND PETRI NET. TWO REPRESENTATIONS OF AN UNDEFINED PETRI NET WITH A NON-EMPTY SET OF EXCLUSIVE ENTITIES
Ignacio Latorre-Biel, Juan
Jimenez-Macias, Emilio
24TH EUROPEAN MODELING AND SIMULATION SYMPOSIUM (EMSS 2012), 2012, : 465 - 470
[30] Petri Net Invariant Synthesis
Chini, Peter
Furbach, Florian
NETWORKED SYSTEMS, NETYS 2021, 2021, 12754 : 187 - 205

← 1 2 3 4 5 →