COMPLETE DECOMPOSITION OF STOCHASTIC PETRI NETS REPRESENTING GENERALIZED SERVICE NETWORKS

Complete decomposition is a new strategy for evaluating the performanc e of a network of generalized service centers, represented in the nota tion of Generalized Stochastic Petri Nets (GSPNs). Each service center can have arbitrary internal structure (including internal parallelism ), but it must conserve tokens at the boundaries, and its inputs must be i/o-connected to its outputs. Routing between centers can depend on the state of the departure center. The new method adapts a delay equi valence decomposition technique used previously. Within this framework , it reduces the solution complexity of the auxiliary models which mus t be solved in the iteration. This new method is applied to a scalable model for computer system performance.