论文信息 - Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets

Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets

The stochastic well-formed colored Petri net (SWN) formalism and the associated reachability graph (RG). The method for computing bounds of quasi-lumpable Markov chains is summarized. A structural analysis algorithm to check whether a given SWN is quasi-lumpable, and a modified symbolic RG (SRG) generation algorithm for the generation of the aggregate MC used for the bounds computation are described. Two application examples are shown.<<ETX>>

Giuliana Franceschinis | Richard R. Muntz

[1] G. Franceschinis,et al. Bounds for Quasi-Lumpable Markow Chains , 1994, Perform. Evaluation.

[2] Serge Haddad,et al. Regular stochastic Petri nets , 1989, Applications and Theory of Petri Nets.

[3] Peter Huber,et al. Towards reachability trees for high-level Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[4] John G. Kemeny,et al. Finite Markov chains , 1960 .

[5] Dan C. Marinescu,et al. On Stochastic High-Level Petri Nets , 1987, PNPM.

[6] Serge Haddad. Une categorie reguliere de reseau de petri de haut niveau : definition, proprietes et reductions, application a la validation de systemes distribues , 1987 .

[7] Kurt Jensen,et al. Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[8] Pierre Semal,et al. Bounds on conditional steady-state distributions in large Markovian and queueing models , 1986 .