




Publications  A solution to the covering problem for 1bounded conflictfree Petri nets using Linear Programming





Reference:
J. Esparza. A solution to the covering problem for 1bounded conflictfree petri nets using linear programming. Information Processing Letters, 41:313–319, 1992.
Abstract:
Given a marking of a Petri net, the covering problem consists of determing if there exists a reachable marking . We show that the covering problem for 1bounded conflictfree 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.
Suggested BibTeX entry:
@article{Esp92,
author = {J. Esparza},
journal = {Information Processing Letters},
pages = {313319},
title = {A solution to the covering problem for 1bounded conflictfree Petri nets using Linear Programming},
volume = {41},
year = {1992}
}




