Paper Info
Title
Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets.
Abstract
We show that, given a finite Its, there is a minimal bounded Petri net over-approximation according to a structural preorder and present an algorithm to compute this over-approximation. This result is extended to subclasses of nets, namely pure Petri nets, plain Petri nets, T-nets, and marked graphs, plus combinations of these properties.
Year
DOI
Venue
2018
10.1007/978-3-319-77313-1_23
Lecture Notes in Computer Science
Keywords
Field
DocType
Petri net synthesis,Petri net properties,Region theory
Discrete mathematics,Graph,Combinatorics,Petri net,Computer science,Preorder,Bounded function
Conference
Volume
ISSN
Citations 
10792
0302-9743
0
PageRank 
References 
Authors
0.34
9
1
Name
Order
Citations
PageRank
Uli Schlachter1265.95