On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
From MaRDI portal
Recommendations
- On boundedness problems for pushdown vector addition systems
- Hyper-Ackermannian bounds for pushdown vector addition systems
- Unboundedness and downward closures of higher-order pushdown automata
- A multiparameter analysis of the boundedness problem for vector addition systems
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Cites work
- A pumping lemma for pushdown graphs of any level
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Full AFLs and nested iterated substitution
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
- scientific article; zbMATH DE number 1929935 (Why is no real title available?)
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- Hyper-Ackermannian bounds for pushdown vector addition systems
- Mathematical Foundations of Computer Science 2005
- Nested Stack Automata
- On boundedness problems for pushdown vector addition systems
- On the coverability problem for pushdown vector addition systems in one dimension
- Parallel program schemata
- Petri nets and large finite sets
- The Complexity of the Finite Containment Problem for Petri Nets
- The covering and boundedness problems for vector addition systems
- Unboundedness and downward closures of higher-order pushdown automata
- Well-structured transition systems everywhere!
- What makes Petri nets harder to verify: stack or data?
This page was built for publication: On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090985)
