For the most recent entries see the
Petri Nets Newsletter.
A Graph Theoretical Characterization of Minimal Deadlocks in Petri Nets.
Bermond, J.C.;
Memmi, G.
In:
Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich.), pages 73-87.
New York: Wiley,
1986.
Abstract:
The main result characterizes minimal deadlocks of a Petri net N in terms
of path properties of the graph of N.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Back to the Petri Nets Bibliography