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

30 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 148-157
https://doi.org/10.1109/pnpm.1993.393455

Abstract

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.

Keywords

This publication has 3 references indexed in Scilit:

Bounds for quasi-lumpable Markov chains
Performance Evaluation, 1994
Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models
IEEE Journal on Selected Areas in Communications, 1986
Coloured petri nets and the invariant-method
Theoretical Computer Science, 1981