We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Persistence of Vector Replacement Systems is Decidable

Thumbnail Image
Download
Name

MIT-LCS-TM-189.pdf

Size

9.01 MB

Format

Adobe PDF

Checksum (MD5)

26a8b06be4924d7d514713328069c495

Author(s)
Mayr, Ernst
Date Issued
January 1981
Series/Report no.
MIT-LCS-TM-189
Abstract
In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent of not, and if so, to construct a semilinera representation of the set of states reachable in the system.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.