Flattability of priority vector addition systems
From MaRDI portal
Cites work
- A structure to decide reachability in Petri nets
- Approximating Petri net reachability along context-free traces
- Coverability trees for Petri nets with unordered data
- Decidability and complexity of Petri nets with unordered data
- Decidability of a temporal logic problem for Petri nets
- Flattability of priority vector addition systems
- Geometry of reachability sets of vector addition systems
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- Hyper-Ackermannian bounds for pushdown vector addition systems
- Linear Arithmetic with Stars
- On functions weakly computable by pushdown Petri nets and related systems
- On the coverability problem for pushdown vector addition systems in one dimension
- On the reachability problem for 5-dimensional vector addition systems
- Population protocols with unordered data
- Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests
- Presburger vector addition systems
- Reachability for two-counter machines with one test and one reset
- Reachability in Petri nets with inhibitor arcs
- Reachability in vector addition systems is Ackermann-complete
- Separability of reachability sets of vector addition systems
- The complexity of coverability in -Petri nets
- The reachability problem for Petri nets is not elementary
- The reachability problem for Petri nets is not primitive recursive
- The Reachability Problem for Vector Addition System with One Zero-Test
- Vector addition system reachability problem: a short self-contained proof
- Vector addition systems reachability problem (a simpler solution)
Cited in
(2)
This page was built for publication: Flattability of priority vector addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875037)
