Box-reachability in vector addition systems

DOI10.1007/978-3-032-09524-4_9MaRDI QIDQ7294399zbMATH OpenFDO

Authors Shaull Almagor, Itay Hasson, Michał Pilipczuk, Michael Zaslavski

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-09524-4_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A multiparameter analysis of the boundedness problem for vector addition systems
• CONCUR 2004 - Concurrency Theory
• Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality
• Elementare Theorie der konvexen Polyeder.
• Geometry of reachability sets of vector addition systems
• scientific article; zbMATH DE number 7559494 (Why is no real title available?)
• Logics for continuous reachability in Petri nets and vector addition systems with states
• On selective unboundedness of VASS
• On the reachability problem for 5-dimensional vector addition systems
• Parallel program schemata
• Parameterized algorithms for block-structured integer programs with large entries
• Reachability in vector addition systems is Ackermann-complete
• The covering and boundedness problems for vector addition systems
• The geometry of reachability in continuous vector addition systems with states
• The reachability problem for Petri nets is not primitive recursive
• The Reachability Problem for Two-Dimensional Vector Addition Systems with States
• Value of the Steinitz constant

This page was built for publication: Box-reachability in vector addition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294399)