Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier.

Published in: IPEC (2010)

Keyphrases

dynamic programming
petri net
vertex cover
brute force search
approximation algorithms
petri net model
colored petri nets
fuzzy petri net
sufficient conditions
service composition
special case
ims ld
planar graphs
partial order
np hard
lower bound
information theoretic
worst case
stochastic petri net