×

On structural conditions for weak persistency and semilinearity of Petri nets. (English) Zbl 0745.68081

Summary: A necessary and sufficient condition for a Petri net to be weakly persistent for every initial marking is obtained. Moreover, a necessary and sufficient condition for reachability is obtainable for this class of Petri nets. As a sufficient condition for a Petri net to have a semilinear reachability set, the notion of sinklessness has been proposed, where a marked Petri net is said to be sinkless if the total number of tokens in each minimal circuit is not decreased to 0 by firing transitions. We show that the reachability set is semilinear if the total number of times that sinklessness is violated is finite during each firing, and define a new subclass of Petri nets which have this property for every initial marking.

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ichikawa, A.; Hiraishi, K., Analysis and control of discrete event systems represented by Petri nets, (Lecture Notes in Control and Information Science, 103 (1987), Springer: Springer Berlin), 115-134 · Zbl 0850.93029
[2] Landweber, L. H.; Lobertson, E. L., Properties of Conflict-Free and Persistent Petri nets, J. ACM, 25, 3, 352-364 (1978) · Zbl 0384.68062
[3] Peterson, J. L., Petri Net Theory and the Modeling of Systems, ((1981), Prentice-Hall: Prentice-Hall Englewood Cliffs), 189-209
[5] Reisig, W., Petri Nets, ((1982), Springer: Springer Berlin), 98-100 · Zbl 0521.68057
[6] Yamasaki, H., On weak persistency of Petri nets, Inform. Process. Lett., 13, 3, 94-97 (1981) · Zbl 0473.68058
[7] Yamasaki, H., Normal Petri nets, Theoret. Comput. Sci., 31, 307-315 (1984) · Zbl 0562.68047
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.