For the most recent entries see the Petri Nets Newsletter.

A Polynomial Time Algorithm to Solve the Covering Problem for 1-Bounded Conflict-Free Petri Nets.

Esparza, Javier

91: Hildesheimer Informatik-Berichte 9, pages 1-9 pp.. Universität Hildesheim (Germany), Institut für Informatik, August 1991.

Abstract: The author shows that the problem of determining if there exists a reachable marking covering a given one in a 1-bounded conflict-free Petri net is solvable in polynomial time. The result generalises previous ones by Howell, Rossier and Yen.

Keywords: polynomial time algorithm (to solve) covering problem (for) 1-bounded conflict-free net; reachable marking.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography