This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks
April 1995 (vol. 44 no. 4)
pp. 577-592

AbstractComplete decomposition is a new strategy for evaluating the performance of a network of generalized service centers, represented in the notation 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 equivalence decomposition technique used previously. Within this framework, it reduces the solution complexity of the auxiliary models which must be solved in the iteration. This new method is applied to a scalable model for computer system performance.

[1] H.H. Ammar and S.M.R. Islam,“Time scale decomposition of a class of generalized stochastic petri net models,” IEEE Trans. Software Eng., vol. 15, no. 6, pp. 809-820, June 1989.
[2] P. Buchholz,“A hierarchical view of GCSPNs and its impact on qualitativeand quantitative analysis,” J. Parallel and Distributed Computing, no. 15, pp. 207-223, July 1992.
[3] P. Buchholz,“Hierarchies in colored GSPNs,” Application and Theory of Petri Nets 1993, LNCS 691, Proc, 14th Int’l Conf.,Chicago, Ill., pp. 106-125, June21-25, 1993.
[4] J. Campos,B. Sanchez,, and M. Silva,“Throughput lower bounds for Markovian petri nets: Transformation techniques,” Fourth Int’l Workshop of Petri Nets and Performance Models, pp. 322-331,Melbourne, Australia, December2-5, 1991.
[5] J. Campos,J.M. Colom,H. Jungnitz,, and M. Silva,“A general iterative technique for approximate throughput computation of stochastic marked graphs,” Fifth Int’l Workshop of Petri Nets and Performance Models, , pp. 138-147,Toulouse, France, Oct.19-22, 1993.
[6] K.M. Chandy,U. Herzog,, and L. Woo,“Parametric analysis of queueing networks,” IBM J. Research Development, vol. 19, no. 9, pp. 36-42, Jan. 1975.
[7] G. Chiola,“GreatSPN 1.5 software architecture,” Proc. Int’l Conf. ModelingTechniques and Tools for Computer Performance Evaluation, pp. 117-132,Torino, Italy, Feb., 1991.
[8] G. Chiola, M. Ajmone Marsan, G. Balbo, and G. Conte, "Generalized Stochastic Petri Nets: A Definition at the Net Level and Its Implications," IEEE Trans. Software Eng., vol. 19, no. 2, pp. 89-107, Feb. 1993.
[9] G. Ciardo and K.S. Trivedi,“A decomposition approach for stochastic Petri net models,” Fourth Int’l Workshop of Petri Nets and Performance Models, pp. 74-83,Melbourne, Australia, December2-5, 1991.
[10] J.M. Colom and M. Silva, "Convex Geometry and Semiflows in P/T Nets. A Comparative Study of Algorithms for Computation of Minimal p-Semiflows," G. Rozenberg, ed., Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, pp. 79-112.Berlin: Springer-Verlag, 1991.
[11] P.A. Jacobson and E.D. Lazowska,“Analyzing queueing networks with simultaneous resource possession,” Comm. ACM, vol. 25, no. 2, pp. 142-151, Feb. 1982.
[12] H. Jungnitz,“Approximation methods for stochastic Petri nets,” PhD thesis,Electrical, Computer, and Systems Eng. Dept., Rensselaer Polytechnic Inst., May 1992.
[13] H. Jungnitz,B. Sanchez,, and M. Silva,“Approximate throughput computation of stochastic marked graph,” J. Parallel and Distributed Computing, no. 15, pp. 282-295, July 1992.
[14] F. Kruckeberg and M. Jaxy,“Mathematical methods for calculating invariants in Petri nets,” Advances in Petri Nets 1987, Lecture Notes in Computer Science 266.
[15] K. Lautenbach,“Linear algebraic calculation of deadlocks and traps,” Concurrency and Nets, Lecture Notes in Computer Science, 1987.
[16] Y. Li and C.M. Woodside,“Iterative decomposition and aggregation of stochastic marked graph Petri nets,” 12th Int’l Conf. Application and Theory of Petri Nets, pp. 257-275,Aarhus, Denmark, June26-28, 1991.
[17] Y. Li,“Solution techniques for stochastic Petri nets,” PhD Thesis, Dept. of Systems and Computer Eng.,Carleton Univ., July, 1992.
[18] Y. Li and C.M. Woodside,“Iterative decomposition and aggregation ofstochastic marked graph Petri nets,” Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, pp. 325-349, a substantially revised version of [9].
[19] M.Ajmone Marsan,G. Balbo,, and G. Conte,“A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems,” ACM Trans. Computer Systems, pp. 93-122, vol. 2, no. 2, May 1984.
[20] M.Ajmone Marsan,S. Donatelli,F. Neri,, and U. Rubino,“On the construction of abstract GSPNs: Anexercise in modeling,” Proc. Fourth Int’l Workshop Petri Nets and Performance Models, pp. 2-17,Melbourne, Australia, Dec.2-5, 1991.
[21] G. Memmi and J. Vautherin,“Analyzing nets by the invariant method,” Lecture Notes in Computer Science 255, Advances in Petri Nets 1986, Part II, pp. 300-337.
[22] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[23] N. Treves,“A comparative study of different techniques for flows computation in place/transition nets,” Lecture Notes in Computer Science 424, Advances in Petri Nets 1989, pp. 433-452.
[24] J-S. Song,S. Satoh,, and C.V. Ramamoorthy,“The abstraction of Petri net,” Telcon 87, vol. 2of 3, pp. 467-471,Seoul, Korea, Aug.25-28, 1987.
[25] C.M. Woodside and Y. Li,“Performance Petri net analysis of communications protocol software by delay-equivalent aggregation,” Fourth Int’l Workshop Petri Nets and Performance Models, pp. 64-73,Melbourne, Australia, Dec.2-5, 1991.

Index Terms:
Stochastic Petri nets (SPN), performance models, decomposition, delay equivalence, generalized service center, service network.
Citation:
C. Murray Woodside, Yao Li, "Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks," IEEE Transactions on Computers, vol. 44, no. 4, pp. 577-592, April 1995, doi:10.1109/12.376171
Usage of this product signifies your acceptance of the Terms of Use.