### Abstract

Original language | American English |
---|---|

Pages (from-to) | 413-442 |

Number of pages | 368 |

Journal | International Journal of Pure and Applied Mathematics |

State | Published - 11 Jun 2012 |

### Fingerprint

### Cite this

}

**Modeling, stability analysis and scheduling design for a class of queuing systems by means of timed petri nets, Lyapunov methods and max-plus algebra.** / Konigsberg, Zvi Retchkiman.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

T1 - Modeling, stability analysis and scheduling design for a class of queuing systems by means of timed petri nets, Lyapunov methods and max-plus algebra

AU - Konigsberg, Zvi Retchkiman

PY - 2012/6/11

Y1 - 2012/6/11

N2 - 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 mathematical 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 queuing 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. Moreover, by using max-plus algebra a schedule for the queuing system is set. © 2012 Academic Publications, Ltd.

AB - 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 mathematical 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 queuing 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. Moreover, by using max-plus algebra a schedule for the queuing system is set. © 2012 Academic Publications, Ltd.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84861873472&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84861873472&origin=inward

M3 - Article

SP - 413

EP - 442

JO - International Journal of Pure and Applied Mathematics

JF - International Journal of Pure and Applied Mathematics

SN - 1311-8080

ER -