In: Proceedings of the Seventeenth Annual ACM Computer Science Conference, 1989, Louisville, KY, USA, pages 1-412 pp.. New York: ACM, 1989.
Abstract: The authors consider the notions of deadlocks, traps, and liveness in Petri nets from a graph theoretic viewpoint. They characterize deadlocks and traps for a special class of Petri nets, namely complete Petri nets, and then determine necessary and sufficient conditions for complete Petri nets to be deadlock free. Similar conditions are determined for trap free complete Petri nets.
Back to the Petri Nets Bibliography