Demystifying Reachability in Vector Addition Systems (Q4635791)
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: Demystifying Reachability in Vector Addition Systems |
scientific article; zbMATH DE number 6863377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Demystifying Reachability in Vector Addition Systems |
scientific article; zbMATH DE number 6863377 |
Statements
Demystifying Reachability in Vector Addition Systems (English)
0 references
23 April 2018
0 references
reachability analysis
0 references
computational complexity
0 references
decidability
0 references
Petri nets
0 references
program verification
0 references
0.9414551
0 references
0.9364868
0 references
0.92850465
0 references
0.92850465
0 references
0 references
0.9128949
0 references
