In: Valette, R.: Lecture Notes in Computer Science, Vol. 815; Application and Theory of Petri Nets 1994, Proceedings 15th International Conference, Zaragoza, Spain, pages 179-198. Springer-Verlag, 1994.
Abstract: We discuss P/T-nets where the arc cardinalities are allowed to be marking-dependent expressions of various types, resulting in a hierarchy of subclasses. Some of the language and decidability properties of these classes have been studied before, but we focus on the practical implications in systems modeling, adding some new insight to the known results about the relative expressive power of the subclasses. We show how the p-semiflows of a P/T-net with marking-dependent arc cardinality can be obtained from the p-semiflows of a related ordinary P/T-net and how bounds on the relative throughputs of the transitions can be obtained, a weaker condition than t-semiflows. Finally, we briefly discuss several modeling applications where these subclasses are used