Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
Data Structures and Algorithms
2015-05-19 v1 Computational Complexity
Abstract
The coverability and boundedness problems for Petri nets are known to be Expspace-complete. Given a Petri net, we associate a graph with it. With the vertex cover number k of this graph and the maximum arc weight W as parameters, we show that coverability and boundedness are in ParaPspace. This means that these problems can be solved in space O(ef(k,W)poly(n)), where ef(k,W) is some exponential function and poly(n) is some polynomial in the size of the input. We then extend the ParaPspace result to model checking a logic that can express some generalizations of coverability and boundedness.
Cite
@article{arxiv.1009.2577,
title = {Small Vertex Cover makes Petri Net Coverability and Boundedness Easier},
author = {M. Praveen},
journal= {arXiv preprint arXiv:1009.2577},
year = {2015}
}
Comments
Full version of the paper appearing in IPEC 2010