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. (c) 2012 Elsevier Inc. All rights reserved.
covering boundedness branching vector addition systems petri nets computational complexity