Reachability in bidirected pushdown VASS

DOI10.4230/LIPICS.ICALP.2022.124MaRDI QIDQ6560926zbMATH OpenFDO

Authors Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.124

zbMATH Keywords

complexitydecidabilitypushdownreachabilityvector addition systems

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(5)

• On continuous pushdown VASS in one dimension
• Bi-reachability in Petri nets with data
• Monus semantics in vector addition systems with states
• Slice closures of indexed languages and word equations with counting constraints
• On the reachability problem for two-dimensional branching VASS

This page was built for publication: Reachability in bidirected pushdown VASS

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