1. Lecture Notes in Computer Science;P. Alimonti,1992
2. H. Baker, Rabin’s Proof of the Undecidability of the Reachability Set Inclusion Problem of Vector Addition Systems, Memo 79, MIT Project MAC, Computer Structure Group, 1973.
3. S. Crespi-Reghizzi and D. Mandrioli, A decidability theorem for a class of vector addition systems,Inform. Process. Lett.,3 (1975), 78–80.
4. J. Esparza, A solution to the covering problem for 1-bounded conflict-free Petri nets,Inform. Process. Lett.,41 (1992), 313–319.
5. M. Garey and D. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, California, 1979.