Normal Petri nets (Q1057065): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:02, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Normal Petri nets |
scientific article |
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
