Geometry of reachability sets of vector addition systems
From MaRDI portal
Cites work
- A structure to decide reachability in Petri nets
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
- Demystifying Reachability in Vector Addition Systems
- Enumerating projections of integer points in unbounded polyhedra
- Geometry of reachability sets of vector addition systems
- Presburger arithmetic, rational generating functions, and quasi-polynomials
- Presburger vector addition systems
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- The reachability problem for Petri nets is not elementary
- The reachability problem for Petri nets is not primitive recursive
- The taming of the semi-linear set
- Vector addition system reachability problem: a short self-contained proof
- Vector addition systems reachability problem (a simpler solution)
Cited in
(5)
This page was built for publication: Geometry of reachability sets of vector addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967343)