Decision Problems for Petri Nets and Vector Addition Systems
Name
MIT-LCS-TM-059.pdf
Size
12.66 MB
Format
Adobe PDF
Checksum (MD5)
91725675704277b66672ffeb139d8750
Author(s)
Hack, Michael
Date Issued
March 1975
Series/Report no.
MIT-LCS-TM-059
MAC-TM-058
Abstract
Petri Nets, Generalized Petri Nets, and Vector Addition Systems can represent each other and thus have common decideability problems. The graphical appeal of Petri Nets is used in a new presentation of the classical problems of boundedness (decidable) and inclusion (undecidable). Various forms of the Reachability Problem are shown to be recursively equivalent to the Liveness Problem for Petri Nets. The decideability of these questions is still open, and some arguments both for and against the decidability of Liveness are presented.
Persistent DSpace Link
