DocumentCode
2600906
Title
Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets
Author
Franceschinis, Giuliana ; Muntz, Richard R.
Author_Institution
Dip. di Inf., Torino Univ., Italy
fYear
1993
fDate
19-22 Oct 1993
Firstpage
148
Lastpage
157
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
Markov processes; Petri nets; graph colouring; parallel programming; program diagnostics; reachability analysis; software performance evaluation; associated reachability graph; quasi-lumpable Markov chains; quasi-lumpable stochastic well-formed nets; structural analysis algorithm; Computational efficiency; Computer science; Parametric statistics; Performance analysis; Petri nets; Roentgenium; Stochastic processes; Stochastic systems; System performance; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1993. Proceedings., 5th International Workshop on
Conference_Location
Toulouse
Print_ISBN
0-8186-4250-5
Type
conf
DOI
10.1109/PNPM.1993.393455
Filename
393455
Link To Document