1. F. Commoner. Deadlocks in Petri nets. Applied Data Research, Inc., Wakefield, Massachusetts, Report CA-7206–2311, (1972).
2. K. Lautenbach. Linear algebraic calculation of deadlocks and traps. In H. J. Genrich, K. Voss und G. Rozenberg (Hrsg.), Con-currency and Nets, S. 315–336. Springer-Verlag, 1987.
3. J. Ezpeleta, J. M. Couvreur und M. Silva. A new technique for finding a generating family of siphons, traps and ST-components. Application to Colored Petri nets. In G. Rozenberg (Hrsg.), Advances in Petri Nets 1993, Band 674 der Serie Lecture Notes in Computer Science, S. 126–147. Springer-Verlag, 1993.
4. J. Esparza und S. Melzer. Checking system properties via Integer Programming. In Hanne Rus Nielson (Hrsg.), ESOP’96, Band 1058 der Serie Lecture Notes in Computer Science, S. 250–264. Springer—Verlag, 1996.
5. E. Best. Representing a program invariant as a linear invariant in a Petri net. EATCS Bulletin 17: 2–11, 1982.