On the construction of abstract GSPNs: an exercise in modeling

The GSPN modeling technique can be used in may different ways. It allows the simple development of detailed, easy-to-understand models of complex systems, that typically are very costly to solve due to their exceedingly large state spaces. However, GSPNs can also be used to develop compact, abstract models with much smaller state spaces at the expense of a greater modeling effort. The authors use an example to show how a compact GSPN model can be developed by progressively abstracting the description of the system behaviour, starting with a very simple and detailed model. The chosen example is a multiserver random polling system.<<ETX>>

[1]  Hideaki Takagi,et al.  Analysis of polling systems , 1986 .

[2]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[3]  Marco Ajmone Marsan,et al.  Analysis of symmetric nonexhaustive polling with multiple servers , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[4]  Marco Ajmone Marsan,et al.  GSPN Models of Markovian Multiserver Multiqueue Systems , 1990, Perform. Evaluation.

[5]  C. H. Chen,et al.  Design and analysis of multiple token ring networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[6]  Leonard Kleinrock,et al.  The Analysis of Random Polling Systems , 1988, Oper. Res..

[7]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[8]  Marco Ajmone Marsan,et al.  Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities , 1987, PNPM.

[9]  Kishor S. Trivedi,et al.  Stochastic Petri Net Models of Polling Systems , 1990, IEEE J. Sel. Areas Commun..

[10]  Marco Ajmone Marsan,et al.  Multiserver multiqueue systems with limited service and zero walk time , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[11]  V. C. Hamacher,et al.  Approximate Analysis of Non-Exhautive Multiserver Polling Systems with Applications to Local Area Networks , 1989, Comput. Networks.

[12]  Fabio Neri,et al.  GSPN models of random, cyclic, and optimal 1-limited multiserver multiqueue systems , 1991, SIGCOMM '91.

[13]  Giovanni Chiola,et al.  GSPNs versus SPNs: what is the actual role of immediate transitions? , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[14]  Gérard Berthelot.  Transformations and Decompositions of Nets , 1986 .

[15]  Ajmone MarsanMarco,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984 .

[16]  Hanoch Levy,et al.  Optimization of Polling Systems , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.