论文信息 - A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming

A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming

Abstract Given a marking μ of a Petri net, the covering problem consist of determining if there exists a reachable marking μ'⩾. We show that the covering problem for 1-bounded conflict-free Petri nets ispolynomially 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.

Javier Esparza

[1] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[2] Hsu-Chun Yen,et al. An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems , 1987, Inf. Process. Lett..

[3] Rodney R. Howell,et al. On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets , 1988, European Workshop on Applications and Theory of Petri Nets.

[4] Hsu-Chun Yen. A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets , 1991, Inf. Process. Lett..

[5] Edward L. Robertson,et al. Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.