Decidability Questions for Petri Nets
Name
MIT-LCS-TR-161.pdf
Size
5.45 MB
Format
Adobe PDF
Checksum (MD5)
2a491ef74c97bcc003582d4500768b50
Author(s)
Hack, Michel Henri Théodore
Advisor(s)
Patil, Suhas Shrikrishna
Date Issued
June 1976
Series/Report no.
MIT-LCS-TR-161
MAC-TR-161
Abstract
An understanding of the mathematical properties of Petri Nets is essential when one wishes to use Petri Nets as an abstract model for concurrent systems. The decidability of various problems which arise in this context is an important aspect of this question. The fact that these problems also arise in the context of other mathematical theories, such as commutative, closure under linear relations, Matrix Context-Free grammars, or Weak Counter Automata, provides further motivation.
Persistent DSpace Link
