TIMED PETRI NETS MODELING AND LYAPUNOV/MAX-PLUS ALGEBRA STABILITY ANALYSIS FOR A TYPE OF QUEUING SYSTEMS

Abstract

A queuing system, is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Place- transitions Petri nets (commonly called Petri nets) are a graphical and math- ematical modeling tool applicable to queuing systems in order to represent its states evolution. Timed Petri nets are an extension of Petri nets, where now the timing at which the state changes is taken into consideration. One of the most important performance issues to be considered in a queuing system is its stability. Lyapunov stability theory provides the required tools needed to aboard the stability problem for queuing systems modeled with timed Petri nets whose mathematical model is given in terms of difference equations. By proving practical stability one is allowed to preassigned the bound on the queu- ing systems dynamics performance. Moreover, employing Lyapunov methods, a sufficient condition for the stabilization problem is also obtained. It is shown that it is possible to restrict the queuing systems state space in such a way that boundedness is guaranteed. However, this restriction results to be vague. This inconvenience is overcome by considering a specific recurrence equation, in the max-plus algebra, which is assigned to the timed Petri net graphical model. In this paper, the modeling and stability problem for a type of queueing systems is addressed. Two classes of queues are considered. The first one (one and two