Paper Info
Title
Properties of Plain, Pure, and Safe Petri Nets.
Abstract
A set of necessary conditions for a Petri net to be plain, pure and safe is given. Some applications of these conditions both in practice (for Petri net synthesis), and in theory (e.g., as part of a characterisation of the reachability graphs of live and safe marked graphs) are described.
Year
DOI
Venue
2017
10.1007/978-3-662-55862-1_1
Lecture Notes in Computer Science
Keywords
Field
DocType
Labelled transition systems,Marked graphs,Petri nets
Graph,Petri net,Programming language,Computer science,Reachability
Journal
Volume
ISSN
Citations 
10470
0302-9743
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Kamila Barylska1295.75
Eike Best237935.97
Uli Schlachter3265.95
Valentin Spreckels400.34