Vector addition system reachability problem, a short self-contained proof
From MaRDI portal
Publication:5408552
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 3928356 (Why is no real title available?)
- Deciding fast termination for probabilistic VASS with nondeterminism
- Porous invariants
- Flat Petri nets (invited talk)
- On the coverability problem for pushdown vector addition systems in one dimension
- Demystifying Reachability in Vector Addition Systems
- scientific article; zbMATH DE number 4092784 (Why is no real title available?)
- The Reachability Problem for Vector Addition System with One Zero-Test
- Rewriting systems for reachability in vector addition systems with pairs
- On selective unboundedness of VASS
- Vector Addition System Reversible Reachability Problem
- On functions weakly computable by pushdown Petri nets and related systems
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- scientific article; zbMATH DE number 7407775 (Why is no real title available?)
- Presburger vector addition systems
- scientific article; zbMATH DE number 7559502 (Why is no real title available?)
- Vector addition system reachability problem: a short self-contained proof
- Porous invariants for linear systems
- Expand, Enlarge, and Check for Branching Vector Addition Systems
- The general vector addition system reachability problem by Presburger inductive invariants
- Guiding Craig interpolation with domain-specific abstractions
- Complexity hierarchies beyond elementary
This page was built for publication: Vector addition system reachability problem, a short self-contained proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408552)