In: ITG-Fachtagung, Neubiberg, Germany, 18-20 September 1991: Informatik-Fachberichte, Vol. 286: Messung, Modellierung und Bewertung von Rechensystemen, 6. GI, pages 292-305. Berlin; Heidelberg: Springer-Verlag,, 1991.
Abstract: In this paper a hierarchical evaluation procedure for Generalized Stochastic Petri Nets (GSPN) is presented which is based on aggregation algorithms that are extensions of Flow Equivalent Aggregation (FEA) and that use transient analysis of Markov Chains. In order to aggregate a subnetwork to a substitute network we consider as criterion for the similarity of the networks the Subnetwork Time Distribution (STD) defined as the distribution of the time a token X needs to proceed through a subnetwork conditioned on the token distribution at the epoch of arrival of X and the context into which the net is embedded just for the experiment of determining a characteristic sojourn time distribution for token X in the subnetwork. The consideration of the second condition may be regarded as the major extension to previous work