On the reachability problem for two-dimensional branching VASS
From MaRDI portal
Cites work
- \(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems
- A polynomial-time algorithm for reachability in branching VASS in dimension one
- An Algorithm for the General Petri Net Reachability Problem
- Approximating Petri net reachability along context-free traces
- scientific article; zbMATH DE number 1956522 (Why is no real title available?)
- scientific article; zbMATH DE number 1841842 (Why is no real title available?)
- Karp-Miller trees for a branching extension of VASS
- ML and extended branching VASS
- Nets with tokens which carry data
- Nonelementary complexities for branching VASS, MELL, and extensions
- On the coverability problem for pushdown vector addition systems in one dimension
- On the reachability problem for 5-dimensional vector addition systems
- Parallel program schemata
- Polynomial-space completeness of reachability for succinct branching VASS in dimension one
- Reachability for bounded branching VASS
- Reachability for two-counter machines with one test and one reset
- Reachability in bidirected pushdown VASS
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- The covering and boundedness problems for branching vector addition systems
- The Reachability Problem for Petri Nets Is Not Elementary
- The reachability problem for Petri nets is not primitive recursive
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States
- The tractability border of reachability in simple vector addition systems with states
- Timed pushdown automata and branching vector addition systems
This page was built for publication: On the reachability problem for two-dimensional branching VASS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310184)
