A graph theoretical characterization of minimal deadlocks in Petri nets - Archive ouverte HAL Access content directly
Conference Papers Year :

A graph theoretical characterization of minimal deadlocks in Petri nets

(1) , (2, 3)
1
2
3
Fichier principal
Vignette du fichier
59-BM85-deadlocks Petrinets.pdf (7.99 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

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⟩
42 View
18 Download

Share

Gmail Facebook Twitter LinkedIn More