A polynomial-time algorithm for reachability in branching VASS in dimension one (Q4598246)
From MaRDI portal
scientific article; zbMATH DE number 6820294
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
