Coverability in a NonFunctional Extension of BVASS
Abstract
We define Vector Addition with Sates and Split/Join Transitions, a new model that extends VASS and BVASS. We define a suitable notion of covering graph for the model, and prove its finiteness and effective constructibility, and prove a coverability theorem.
Domains
Computational Complexity [cs.CC]| Origin | Files produced by the author(s) |
|---|
Loading...