An Effective Representation of the Reachability Set of Persistent Petri Nets
| dc.contributor.author | Mayr, Ernst | en_US |
| dc.date.accessioned | 2023-03-29T14:18:08Z | |
| dc.date.available | 2023-03-29T14:18:08Z | |
| dc.date.issued | 1981-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148999 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-188 | |
| dc.title | An Effective Representation of the Reachability Set of Persistent Petri Nets | en_US |
| dc.identifier.oclc | 7567861 |
