Uniqueness of minimal 1-safe Petri net generating all the binary \(n\)-vectors as its marking vectors exactly once (Q2842083)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Uniqueness of minimal 1-safe Petri net generating all the binary \(n\)-vectors as its marking vectors exactly once |
scientific article; zbMATH DE number 6192969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness of minimal 1-safe Petri net generating all the binary \(n\)-vectors as its marking vectors exactly once |
scientific article; zbMATH DE number 6192969 |
Statements
31 July 2013
0 references
1-safe Petri net
0 references
reachability tree
0 references
binary \(n\)-vector
0 references
marking vector
0 references
complete bopartite graph
0 references
Uniqueness of minimal 1-safe Petri net generating all the binary \(n\)-vectors as its marking vectors exactly once (English)
0 references
