A polynomial-time algorithm for reachability in branching VASS in dimension one (Q4598246)
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: A polynomial-time algorithm for reachability in branching VASS in dimension one |
scientific article; zbMATH DE number 6820294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for reachability in branching VASS in dimension one |
scientific article; zbMATH DE number 6820294 |
Statements
19 December 2017
0 references
branching vector addition systems
0 references
reachability
0 references
coverability
0 references
boundedness
0 references
A polynomial-time algorithm for reachability in branching VASS in dimension one (English)
0 references
0.9466523
0 references
0.8919229
0 references
0.8452128
0 references
0.83947825
0 references
0.8390967
0 references
0.8389937
0 references
0.83576274
0 references
