The covering and boundedness problems for branching vector addition systems

The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.

► The covering and boundedness problems for branching VAS are shown 2ExpTime-complete.
► The techniques of Rackoff and Lipton for VAS are substantially extended.
► A new result on small solutions of integer programming problems is obtained.