Small Vertex Cover makes Petri Net Coverability and Boundedness Easier.

Published in: Algorithmica (2013)

Keyphrases

petri net
vertex cover
brute force search
approximation algorithms
petri net model
colored petri nets
service composition
planar graphs
fuzzy petri net
ims ld
precedence constraints
stochastic petri net
scheduling problem
partial order
optimality criterion