LCS Publication Details
Publication Title: AN EFFECTIVE REPRESENTATION OF THE REACHABILITY SET OF PERSISTENT PETRI NETS
Publication Author: Mayr, Ernst
Additional Authors:
LCS Document Number: MIT-LCS-TM-188
Publication Date: 1-1-1981
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
In this report, an effective algorithm is represented which, for the given persistent Petri net, constructs a semilinear representation of its reachability set. The notion of persistence appears in connection with Parallel Program Schemata [7], where persistent operators, once the are enabled, stay so until they are fired, or in connection with the "Church-Rosser-Property"[16]. Also, Lipton et al. [1] use a similar property when studying linear asynchronous systems, as do Muller and Bantky [13] for switching circuits.
To obtain this publication:

    To purchase a printed copy of this publication please contact MIT Document Services.