A graph theoretical characterization of minimal deadlocks in Petri nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1985

Dates and versions

hal-02447228 , version 1 (21-01-2020)

Identifiers

  • HAL Id : hal-02447228 , version 1

Cite

Jean-Claude Bermond, Gerard Memmi. A graph theoretical characterization of minimal deadlocks in Petri nets. Graph theory with applications to algorithms and computer science, Wiley, 1985, Kalamazoo,MI, United States. pp.73-87. ⟨hal-02447228⟩
85 View
20 Download

Share

Gmail Facebook X LinkedIn More