Modeling priority schemes with timed Petri nets

The applicability of well known medium access control (MAC) protocols for real time systems is of great interest for the development of suitable communication schemes in this field. This paper introduces models for the priority schemes of well known token protocols, since they provide deterministic behaviour and therefore guarantee time constraints. Deterministic and Stochastic Petri Nets (DSPN) are used as a flexible graphical description technique for concurrent and distributed systems. Powerful analysis tools for this class of timed Petri nets are also available. Performance evaluations of the presented models allow to determine the transmission characteristic of the protocols considering the different priority levels.<
>