Issue No. 11 - November (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.247838
<p>The class of stochastic well-formed colored nets (SWN's) was defined as a syntactic restriction of stochastic high-level nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the symbolic reachability graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net. Moreover, most constructs useful for the modeling of distributed computer systems and architectures directly match the "well-formed" restriction, without any need of transformation. A nontrivial example of the usefulness of the technique in the performance modeling and evaluation of multiprocessor architectures is included.</p>
stochastic well-formed colored nets; SWN; stochastic high-level nets; syntactic restriction; model definition; symbolic reachability graph; complexity; Markovian performance evaluation; Petri net; performance modeling; computational complexity; memory contention; lumpability condition; computational complexity; multiprocessing systems; performance evaluation; Petri nets.
S. Haddad, G. Chiola, C. Dutheillet and G. Franceschinis, "Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications," in IEEE Transactions on Computers, vol. 42, no. , pp. 1343-1360, 1993.