An Effective Representation of the Reachability Set of Persistent Petri Nets

Thumbnail Image
Download
Name

MIT-LCS-TM-188.pdf

Size

2.83 MB

Format

Adobe PDF

Checksum (MD5)

9337cecfc9d120216ea21da25dd0470b

Author(s)
Mayr, Ernst
Date Issued
January 1981
Series/Report no.
MIT-LCS-TM-188
Abstract
In a persistent Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which constructs a semilinear representation of the set of states reachable in an arbitrary persistent Petri net.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.