Reachability in vector addition system with states parameterized by geometric dimension

DOI10.4230/LIPICS.CONCUR.2025.38MaRDI QIDQ7310318zbMATH OpenFDO

Authors Yangluo Zheng

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.38

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• scientific article; zbMATH DE number 827979 (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
• New pumping technique for 2-dimensional VASS
• Reachability in Succinct and Parametric One-Counter Automata
• Reachability in two-clock timed automata is PSPACE-complete
• 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
• 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
• The taming of the semi-linear set

This page was built for publication: Reachability in vector addition system with states parameterized by geometric dimension

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