Stability Analysis of Buffer Priority Scheduling Policies Using Petri Nets

A Petri net approach to determiningthe conditions for stability of a re-entrant system with buffer priorityscheduling policy is described in this paper. The concept of bufferboundedness based on the dynamic behavior of the markings in the systemmodel is emphasized. The method is used to demonstrate the stability ofthe first buffer first served (FBFS) and the last buffer first served(LBFS) scheduling policies. Finally a sufficient condition forinstability of systems with a positive feedback loop (PFL) isestablished, and an example is given.