*For the most recent entries see the
Petri Nets Newsletter.*

## A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming.

Esparza, J.
In:
*Information Processing Letters 41 (1992) 313-319, N. Holland, Elsevier Sci. Publ. BV*.
1992.

Abstract:
Given a marking m of a Petri net, the covering problem consists of
determining if there exists a reachable marking m'. We show that the
covering problem for 1-bounded conflict-free Petri nets is polynomially
reducible to a Linear Programming problem. This proves that the covering
problem is in PTIME for this class of Petri nets, which generalises a
result of Yen.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*