Normal Petri nets (Q1057065)
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: Normal Petri nets |
scientific article; zbMATH DE number 3896314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Normal Petri nets |
scientific article; zbMATH DE number 3896314 |
Statements
Normal Petri nets (English)
0 references
1984
0 references
The author deals with the reachability problem for Petri nets. He defines normal Petri nets (in which the total number of tokens in an arbitrary minimal circuit does not decrease by firing transitions) and shows that their reachability sets are effectively computable semilinear sets.
0 references
reachability sets
0 references
