Contex-Free Controlled Vector Addition Systems

I propose to present recent and ongoing work on Pushdown VASS, that ex- tend Vector Addition Systems with a stack. What can be modelled with these systems? What are interesting open problems and how to attack them? In [4] we discussed an equivalent formalism, which amounts to VASS that allow only runs from a context-free control language, similar to the regulated rewriting setting [1]. Reachability problems like coverability and boundedness can then be attacked by analysing annotated derivation trees of a GfG. This not only helps to simplify proofs but also to address slightly more general problems. This is joint work with Jerome Leroux and Gregoire Sutre.

Authors

• Patrick Totzke

Keywords

No keywords are indexed for this paper.