In: Proceedings of the ACM Eighteenth Annual Computer Science Conference (CSC90), 1990, Washington, DC, USA. New York, NY, USA: ACM, 1990.
Abstract: Petri nets are used as models of asynchronous concurrent systems. Many properties of Petri nets and the systems they model can be described in graph theoretic terms. These include the notions of deadlocks and traps. In this paper the authors consider these properties by restricting attention to some special classes of Petri nets including simple, complete, and free-choice Petri nets.
Keywords: deadlock; trap; simple net; complete net; free-choice net.