Skip to main content
Log in

Service stage Petri net models with product form solution

  • Contributed Papers
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A class of service stage Petri net models whose equilibrium probabilities satisfy local balance equations is presented. Examples of their applicability include bus oriented multiprocessor interconnections, the classical dining philosophers problem and the alternating bit protocol. The natural topological space for embedding the state transition lattice for this class of SSPN is shown to be a multidimensional toroidal manifold.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H.H. Ammar and R.W. Liu, Analysis of the generalized stochastic Petri nets by state aggregation,Int. Workshop on Timed Petri Nets, Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986) pp. 88–95.

    Google Scholar 

  2. 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 22 (2) (1975) 248–260.

    Google Scholar 

  3. W. Brauer (ed.), Net theory and applications,Proc. Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979 (Springer, 1980).

    Google Scholar 

  4. S.C. Bruell and S. Ghanta, Throughput bounds for generalized stochastic Petri net models,Int. Workshop on Timed Petri Nets Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986) pp. 250–261.

    Google Scholar 

  5. Y.C. Cheng and T.G. Robertazzi, The lattice geometry of Petri network models of multihop radio networks,Proc. 22nd Annual Conf. on Information Sciences and Systems, Princeton, NJ (March 1988) pp. 251–256.

  6. J. Dennis (ed.),Record of the Project MAC Conf. on Concurrent Systems and Parallel Computation, ACM, New York (June 1970).

    Google Scholar 

  7. E.W. Dijkstra, Cooperating sequential processes,Programming Languages, F. Genvys (ed.) (Academic Press, New York, 1968) pp. 43–112.

    Google Scholar 

  8. J.B. Dugan, G. Ciardo, A. Bobbio and K. Trivedi, The design of a unified package for the solution of stochastic Petri net models,Int. Workshop on Timed Petri Nets, Torino, Italy, 1985 (IEEE Computer Society Press, 1986) pp. 6–13.

    Google Scholar 

  9. R.E. Filman and D.P. Friedman,Coordinated Computing, Tools and Techniques for Distributed Software (McGraw-Hill, New York, 1984).

    Google Scholar 

  10. G. Florin and S. Natkin, Evaluation des performances d'un protocole de communication a l'aide des réseaux de Petri et des processus stochastiques, J. AFCET Multiprocesseurs et Multiordinateurs en Temps Réel (1978) E0-E26.

  11. W.J. Gordon and G.F. Newell, Closed queueing systems with exponential servers, Oper. Res. 15 (1967) 254–265.

    Google Scholar 

  12. E. Gressier, A stochastic Petri net model for Ethernet,Int. Workshop on Timed Petri Nets, Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986) pp. 296–306.

    Google Scholar 

  13. P.J. Haas and G.S. Shedler, Regenerative simulation of stochastic Petri nets, ibid., Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986), pp. 14–21.

    Google Scholar 

  14. W. Henderson and D. Lucie, Applications of generalised Markov processes to stochastic Petri nets,Performance of Distributed and Parallel Systems, T. Hasegawa, H. Takagi and Y. Takahashi (eds.) (North-Holland, 1989).

  15. A. Holt, H. Saint, R. Shapiro and S. Warshall, Final report of the information system theory project, Technical Report RADC-TR-68-305. Rome Air Development Center, Griffiss Air Force Base, New York (1968) 352 pp.

    Google Scholar 

  16. J.R. Jackson, Networks of waiting lines, Oper. Res. 5 (1957).

  17. P.S. Kritzinger, A performance model of the OSI communication architecture, IEEE Trans. Commun. COM-34 (1986) 554–563.

    Google Scholar 

  18. A.A. Lazar and T.G. Robertazzi, The geometry of lattices for Markovian queueing networks, Research Report, Center for Telecommunications Research, Columbia University (1984). Available from T. Robertazzi upon request.

  19. A.A. Lazar and T.G. Robertazzi, The geometry of lattices for multiclass Markovian queueing networks,Proc. 18th Conf. on Information Sciences and Systems, Princeton University, Princeton, NJ (1984) pp. 164–168.

    Google Scholar 

  20. A.A. Lazar, An algebraic topological approach to Markovian queueing networks, ibid., pp. 437–442.

    Google Scholar 

  21. A.A. Lazar and T.G. Robertazzi, Markovian Petri net protocol models with product form solution,Proc. IEEE INFOCOM '87, San Francisco, CA (1987) pp. 1054–1062.

  22. A.A. Lazar and T.G. Robertazzi, The algebraic and geometric structure of Markovian Petri network lattices,Proc. 24th Annual Allerton Conf. on Communications, Control and Computing, Urbana-Champaigne, Illinois (Oct. 1986) pp. 834–843.

  23. M. Marsan, G. Balbo, G. Conte and F. Gregoretti, Modelling bus contention and memory interference in a multiprocessor system, IEEE Trans. Computers C-32 (1983) 60–72.

    Google Scholar 

  24. M. Marsan, G. Balbo and G. Conte, A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems, ACM Trans. Computer Systems (May 1984).

  25. M. Marsan, G. Balbo and G. Conte,Performance Models of Multiprocessor Systems (The MIT Press, Cambridge, MA, 1986).

    Google Scholar 

  26. M. Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte and A. Cumani, On Petri nets with stochastic timing,Int. Workshop on Timed Petri Nets, Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986) pp. 80–87.

    Google Scholar 

  27. M.K. Molloy, Performance analysis using stochastic Petri nets, IEEE Trans. Computers C-31 (1982) 913–917.

    Google Scholar 

  28. M.K. Molloy, Fast bounds for stochastic Petri nets,Int. Workshop on Timed Petri Nets, Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986) pp. 244–249.

    Google Scholar 

  29. J.L. Peterson,Petri Net Theory and the Modeling of Systems (Prentice Hall, 1981).

  30. C.A. Petri, Kommunikation mit Automaten, Ph.D. Thesis, Univ. of Bonn, FRG (1962).

    Google Scholar 

  31. S.D. Shapiro, A stochastic Petri net with applications to modeling occupancy times for concurrent task systems, Networks (1979) 375–379.

  32. I.Y. Wang and T.G. Robertazzi, The probability flux circulation of certain communication and computation state models,Proc. 1986 Information Sciences and Systems Conf., Princeton, NJ (March 1986).

  33. C.Y. Wong, T.S. Dillon and K.E. Forward, Timed places Petri nets with stochastic representation of place time,Int. Workshop on Timed Petri Nets, Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986) pp. 96–103.

    Google Scholar 

  34. A. Zenie, Colored stochastic Petri nets, ibid., Torino, Italy, 1985 (IEEE Comp. Soc. Press, 1986), pp. 262–271.

    Google Scholar 

  35. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985 (IEEE Computer Society Press, 1986).

  36. 1987 Int. Workshop on Petri Nets and Performance Analysis, Madison, Wisconsin (IEEE Computer Society Press, 1987).

  37. 3rd Int. Workshop on Petri Nets and Performance Models, Kyoto, Japan (IEEE Computer Society Press, December 1989).

  38. G. Ciardo, J. Muppala and K. Trivedi, SPNP: stochastic Petri net package, in ref. [37], pp. 142–151.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, I.Y., Robertazzi, T.G. Service stage Petri net models with product form solution. Queueing Syst 7, 355–373 (1990). https://doi.org/10.1007/BF01154551

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01154551

Keywords

Navigation