Author links open the overlay panel. Numbers correspond to the affiliation list which can be exposed by using the show more link. We demonstrate the usefulness of Petri nets for treating problems about vector addition systems by giving a simple exposition of Rabin’s proof of the undecidability of the inclusion problem for vector addition system reachability sets, and then proceed to show that the inclusion problem can be reduced to the equality problem for reachability sets. Technical Report TR-94, Project MAC, M.I.T, Cambridge, Mass (February 1972) Corrections to Computation Structures Note 17, Project MAC, M.I.T, Cambridge, Mass (June 1974) The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems Nachr. Akad. Wiss. Göttingen Math.-Phys. (1900), pp. 253–297Bull. Am. Math. Soc., 8 (1901–1902), pp. 437–479 Translation: Copyright © 2016 Elsevier B.V. or its licensors or contributors. ScienceDirect® is a registered trademark of Elsevier B.V. Source.