Reachability in 3-VASS is elementary
From MaRDI portal
Cites work
- A structure to decide reachability in Petri nets
- Complexity hierarchies beyond elementary
- CONCUR 2004 - Concurrency Theory
- Demystifying Reachability in Vector Addition Systems
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Improved algorithm for reachability in d-VASS
- Minimal solutions of linear diophantine systems : bounds and algorithms
- New lower bounds for reachability in vector addition systems
- On the reachability problem for 5-dimensional vector addition systems
- Reachability in Succinct and Parametric One-Counter Automata
- Reachability in two-dimensional unary vector addition systems with states is NL-complete
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- Shortest paths in one-counter systems
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- The covering and boundedness problems for 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 taming of the semi-linear set
- The tractability border of reachability in simple vector addition systems with states
This page was built for publication: Reachability in 3-VASS is elementary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397613)
