
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C. Murray Woodside, Yao Li, "Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks," IEEE Transactions on Computers, vol. 44, no. 4, pp. 577592, April, 1995.  
BibTex  x  
@article{ 10.1109/12.376171, author = {C. Murray Woodside and Yao Li}, title = {Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {4}, issn = {00189340}, year = {1995}, pages = {577592}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.376171}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks IS  4 SN  00189340 SP577 EP592 EPD  577592 A1  C. Murray Woodside, A1  Yao Li, PY  1995 KW  Stochastic Petri nets (SPN) KW  performance models KW  decomposition KW  delay equivalence KW  generalized service center KW  service network. VL  44 JA  IEEE Transactions on Computers ER   
[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. 809820, 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. 207223, 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. 106125, June2125, 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. 322331,Melbourne, Australia, December25, 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. 138147,Toulouse, France, Oct.1922, 1993.
[6] K.M. Chandy,U. Herzog,, and L. Woo,“Parametric analysis of queueing networks,” IBM J. Research Development, vol. 19, no. 9, pp. 3642, Jan. 1975.
[7] G. Chiola,“GreatSPN 1.5 software architecture,” Proc. Int’l Conf. ModelingTechniques and Tools for Computer Performance Evaluation, pp. 117132,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. 89107, 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. 7483,Melbourne, Australia, December25, 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 pSemiflows," G. Rozenberg, ed., Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, pp. 79112.Berlin: SpringerVerlag, 1991.
[11] P.A. Jacobson and E.D. Lazowska,“Analyzing queueing networks with simultaneous resource possession,” Comm. ACM, vol. 25, no. 2, pp. 142151, 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. 282295, 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. 257275,Aarhus, Denmark, June2628, 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. 325349, 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. 93122, 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. 217,Melbourne, Australia, Dec.25, 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. 300337.
[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. 433452.
[24] JS. Song,S. Satoh,, and C.V. Ramamoorthy,“The abstraction of Petri net,” Telcon 87, vol. 2of 3, pp. 467471,Seoul, Korea, Aug.2528, 1987.
[25] C.M. Woodside and Y. Li,“Performance Petri net analysis of communications protocol software by delayequivalent aggregation,” Fourth Int’l Workshop Petri Nets and Performance Models, pp. 6473,Melbourne, Australia, Dec.25, 1991.