Stability analysis of buffer boundedness scheduling policies using timed Petri net models

A timed Petri net approach to determining the conditions for stability of a re-entrant line system with buffer priority scheduling policy is described in this paper. We use the concept of buffer boundedness based on the dynamic behaviour of the markings in the system model. The method is used to demonstrate the stability of the fixed priority scheduling policies. We derive stability properties of basic timed Petri net structures and sufficient conditions for system stability based on the concept of positive feedback loop (PFL).