On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension

2015/03/13 by Jérôme Leroux, Leroux, Jérôme, Grégoire Sutre +3 · 1 citation
Computer Science · #Formal Methods in Verification #Logic, programming, and type systems #semigroups and automata theory

paper · doi:10.48550/arxiv.1503.04018

Abstract

Does the trace language of a given vector addition system (VAS) intersect with a given context-free language? This question lies at the heart of several verification questions involving recursive programs with integer parameters. In particular, it is equivalent to the coverability problem for VAS that operate on a pushdown stack. We show decidability in dimension one, based on an analysis of a new model called grammar-controlled vector addition systems.

Cited by

• On the Reachability Problem for Two-Dimensional Branching VASS

Related

• Continuous Pushdown VASS in One Dimension are Easy
• Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
• Universality Problem for Unambiguous VASS
• On Boundedness Problems for Pushdown Vector Addition Systems
• Unboundedness problems for languages of vector addition systems