ANALYSIS OF PRIORITY QUEUE WITH REPEATED ATTEMPTS USING GENERALIZED STOCHASTIC PETRI NETS.

The paper deals with the modeling and analysis of a single server queue with repeated attempts and two priority customers involving generalized stochastic Petri nets. Indeed, the consideration of the recalls and priority introduces great analytical difficulties. Therefore, by using the GSPN, we show how this high level formalism allows us to cope with the complexity of this system. The paper extends previous works on this topic and evaluate different performance characteristics of the system. The Markov chain is obtained and some numerical results are presented to illustrate the effect of the system parameters on the developed performance measures. [ABSTRACT FROM AUTHOR]