1. “Decidability problems on the strong connectivity of Petri net reachability sets”;Araki;TCS,1977
2. Bouziane Z. “Algorithmes primitifs récursifs et problèmes EXPSPACE-complets dans les réseaux de Petri cycliques”, Thèse de Doctorat de 1'ENS de Cachan, November 1996.
3. Bouziane Z., Finkel F. “The equivalence problem for commutative semigroups and reversible Petri nets is complete in exponential space under log-lin reducibility“, Presented at the International Conference in Semigroups and Related Topics at Kunming, China, August 1995 (Springer Verlag Proceeding 1997).
4. Cardoza E. Lipton R. Meyer A.”Exponential space complete problems for Petri nets and commutative semigroups“, Proc. of the 8th annual ACM Symposium on Theory of Computing, pp. 50-54, 1976.
5. “Marked directed graphs”;Commoner;Journal of Computer and System Sciences,1971