A graph theoretical characterization of minimal deadlocks in Petri nets

Jean-Claude Bermond 1 Gerard Memmi 2
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Complete list of metadatas

https://hal.inria.fr/hal-02447228
Contributor : Jean-Claude Bermond <>
Submitted on : Tuesday, January 21, 2020 - 2:47:37 PM
Last modification on : Thursday, January 23, 2020 - 1:04:34 AM

File

59-BM85-deadlocks Petrinets.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02447228, version 1

Citation

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⟩

Share

Metrics

Record views

27

Files downloads

167