On continuous pushdown VASS in one dimension

DOI10.4230/LIPICS.CONCUR.2024.34MaRDI QIDQ6859913zbMATH OpenFDO

Authors Guillermo A. Pérez, Shrisha Rao

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

pushdown automatareachabilityvector addition systems

Mathematics Subject Classification ID

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

Cites work

• A lower bound for the coverability problem in acyclic pushdown VAS
• Automated Deduction – CADE-20
• Continuous One-counter Automata
• Decidability and complexity of decision problems for affine continuous vass
• Directed reachability for infinite-state systems
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Hyper-Ackermannian bounds for pushdown vector addition systems
• On the coverability problem for pushdown vector addition systems in one dimension
• Reachability in bidirected pushdown VASS
• Reachability in vector addition systems is primitive-recursive in fixed dimension
• The Reachability Problem for Petri Nets Is Not Elementary
• Unary pushdown automata and straight-line programs

This page was built for publication: On continuous pushdown VASS in one dimension

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