The covering and boundedness problems for branching vector addition systems
作者：
Highlights：
•
摘要
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
论文关键词：Petri nets,Branching vector addition systems,Covering,Boundedness,Computational complexity
论文评审过程：Received 5 April 2011, Revised 15 March 2012, Accepted 4 April 2012, Available online 6 April 2012.
论文官网地址：https://doi.org/10.1016/j.jcss.2012.04.002
