The reachability problem for Petri nets is not elementary (Q5212744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7160486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The reachability problem for Petri nets is not elementary |
scientific article; zbMATH DE number 7160486 |
Statements
The reachability problem for Petri nets is not elementary (English)
0 references
30 January 2020
0 references
Petri nets
0 references
reachability problems
0 references
vector addition systems
0 references
0.9976086616516112
0 references
0.8309924602508545
0 references
0.8112468123435974
0 references
0.8093781471252441
0 references
0.8061720728874207
0 references
