Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks

IEEE Transactions on Automatic Control

Volumn 36, Issue 12, 1991, Pages 1368-1382

  Campos, Javier ^a   Chiola, Giovanni ^b   Silva, Manuel ^a  

^a UNIVERSITY OF ZARAGOZA   (Spain)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING, LINEAR; MATHEMATICAL TECHNIQUES - PETRI NETS;

FREE CHOICE NETS; SYNCHRONIZED QUEUEING NETWORKS;

PROBABILITY;

EID: 0026372827     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.106153     Document Type: Article

References (40)

1. F. Baskett, K. M. Chandy, R. R. Muntz, and F. Palacios, “Open, closed, and mixed networks of queues with different classes of customers,” J. ACM, vol. 22, no. 2, pp. 248-260, Apr. 1975.
2. Proceedings of the International Workshop on Timed Petri Nets, Torino, Italy. Los Alamitos, CA: IEEE Computer Society, July 1985.
3. Proceedings of the International Workshop on Petri Nets and Performance Models, Madison, WI. Los Alamos, CA: IEEE Computer Society, Aug. 1987.
4. Proceedings of the 3rd International Workshop on Petri Nets and Performance Models, Kyoto, Japan. Los Alamos, CA: IEEE Computer Society, Dec. 1989.
5. J. R. Jackson, “Jobshop-like queueing systems,” Management Science, vol. 10, no. 1, pp. 131-142, Oct. 1963.
6. J. Campos and M. Silva, “Steady-state performance evaluation of totally open systems of Markovian sequential processes,” in Decentralized Systems, M. Cosnard and C. Girault, Eds. Amsterdam, The Netherlands: Elsevier, 1990, pp. 427-438.
7. M. Ajmone Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte, and A. Cumani, “The effect of execution policies on the semantics and analysis of stochastic Petri nets,” IEEE Trans. Software Eng., vol. 15, no. 7, pp. 832-846, July 1989.
8. J. Campos, G. Chiola, J. M. Colom, and M. Silva, “Tight polynomial bounds for steady-state performance of marked graphs,” in Proc. 3rd Internat. Workshop on Petri Nets and Performance Models, Kyoto, Japan. Los Alamitos, CA: IEEE Computer Society, Dec. 1989, pp. 200-209.
9. J. Campos, G. Chiola, and M. Silva, “Ergodicity and throughput bounds of Petri nets with unique consistent firing count vector,” IEEE Trans. Software Eng., vol. 17, no. 2, pp. 117-125, Feb. 1991.
10. M. H. T. Hack, “Analysis of production schemata by Petri nets,” M.S. thesis, Mass. Inst. Technol., Cambridge, MA, 1972.
11. P. S. Thiagarajan and K. Voss, “A fresh look at free choice nets,” Informat. Contr., vol. 61, no. 2, pp. 85-113, May 1984.
12. E. Best, “Structure theory of Petri nets: The free choice hiatus,” in Advances in Petri Nets 1986—Part I, Vol. 254 of LNCS, W. Brawer, W. Reisig, and G. Rozenberg, Eds. New York: Springer-Verlag, 1987, pp. 168-205.
13. C. H. Sauer, E. A. MacNair, and J. F. Kurose, “The research queueing package: Past, present, and future,” in Proc. 1982 National Comp. Conf., AFIPS, 1982.
14. F. Baccelli and A. Makowski, “Queueing models for systems with synchronization constraints,” Proc. IEEE, vol. 77, no. 1, pp. 138-161, Jan. 1989.
15. M. Vernon, J. Zahorjan, and E. D. Lazowska, “A comparison of performance Petri nets and queueing network models,” in Proc. 3rd Internat. Workshop Modelling Techniques and Performance Evaluation, Paris, France, Mar. 1987, pp. 181-192.
16. M. Ajmone Marsan, G. Balbo, G. Chiola, and S. Donatelli, “On the product-form solution of a class of multiple-bus multiprocessor system models,” J. Syst. Software, vol. 6, nos. 1, 2, pp. 117-124, May, 1986.
17. J. Y. Le Boudec, “A BCMP extension to multiserver stations with concurrent classes of customers,” in Proc. Performance ‘86 and ACM Sigmetrics, Raleigh, NC, May 1986.
18. T. Murata, “Petri nets: Properties, analysis, and applications,” Proc. IEEE, vol. 77, no. 4, pp. 541-580, Apr. 1989.
19. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
20. M. Silva, Las Redes de Petri en la Automática y la Informática. Editorial AC, Madrid, Spain, 1985 (in Spanish).
21. W. Brauer, W. Reisig, and G. Rozenberg, Eds. Advances in Petri Nets 1986, Vols. 254 and 255 LNCS. New York: Springer-Verlag, 1987.
22. J. M. Colom and M. Silva, “Improving the linearly based characterization of P/T nets,” in Advances in Petri Nets 1990, Vol. 483 LNCS, G. Rozenberg, Ed. New York: Springer-Verlag, 1991, pp. 113-145.
23. J. Sifakis, “Use of Petri nets for performance evaluation,” Acta Cybernetica, vol. 4, no. 2, pp. 185-202, 1978.
24. C. Ramchandani, “Analysis of asynchronous concurrent systems by Petri nets,” Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, Feb. 1974.
25. M. K. Molloy, “Performance analysis using stochastic Petri nets,” IEEE Trans. Computers, vol. 31, no. 9, pp. 913-917, Sept. 1982.
26. G. Florin and S. Natkin, “Les réseaux de Petri stochastiques,” Technique et Science Informatiques, vol. 4, no. 1, pp. 143-160, Feb. 1985 (in French).
27. W. M. Zuberek, “Performance evaluation using timed Petri nets,” in Proc. Internat. Workshop Timed Petri Nets, Torino, Italy. Los Alamitos, CA: IEEE Computer Society, July 1985, pp. 272-278.
28. M. A. Holliday and M. Vernon, “A generalized timed Petri net model for performance analysis,” IEEE Trans. Software Eng., vol. 13, no. 12, pp. 1297-1310, Dec. 1987.
29. L. Kleinrock, Queueing Systems Volume I: Theory. New York: Wiley, 1975.
30. M. Silva and J. M. Colom, “On computation of structural synchronic invariants in P/T nets,” in Advances in Petri Nets 1988, Vol. 340 LNCS, G. Rozenberg, Ed. New York: Springer-Verlag, 1988, pp. 386-417.
31. M. Silva, “Towards a synchrony theory for P/T nets,” in Concurrency and Nets, K. Voss, H. Genrich, and G. Rozenberg, Eds. New York: Springer-Verlag, 1987, pp. 435-460.
32. J. Esparza, “Structure theory of free choice nets,” Ph.D. dissertation, Departamento de Ingenieria Electrica e Informática, Universidad de Zaragoza, Spain, June 1990; also in Res. Rep. GISI-RR-90-03.
33. W. Vogler, “Live and bounded free choice nets have home states,” Petri Net Newsletter, vol. 32, pp. 18-21, Apr. 1989.
34. J. Campos, “Performance bounds for synchronized queueing networks,” Ph.D. dissertation, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, Spain, Dec. 1990; also in Res. Rep. GISI-RR-90-20.
35. E. Best and J. Desel, “Partial order behaviour and structure of Petri nets,” Formal Aspects of Computing, vol. 2, no. 2, pp. 123-138, 1990.
36. G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, Eds. Optimization, Vol. 1, Handbooks in Operations Research and Management Science. Amsterdam, The Netherlands: North-Holland, 1989.
37. C. V. Ramamoorthy and G. S. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Trans. Software Eng., vol. 6, no. 5, pp. 440-449, Sept. 1980.
38. T. Murata, “Use of resource-time product concept to derive a performance measure of timed Petri nets,” in Proc. 1985 Midwest Symp. Circuits and Syst., Louisville, KY, Aug. 1985.
39. J. Esparza and M. Silva, “On the analysis and synthesis of free choice systems,” in Advances in Petri Nets 1990, Vol. 483 LNCS, G. Rozenberg, Ed. New York: Springer-Verlag, 1991, pp. 243-286.
40. J. M. Colom, J. Campos, and M. Silva, “On liveness analysis through linear algebraic techniques,” in Proc. Annual General Meeting of ESPRIT Basic Research Action 3148 Design Methods Based on Nets (DEMON), Paris, France, June 1990.