Stability analysis of buffer priority scheduling policies using Petri nets

Abstract

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