Piecewise linear test functions for stability of queueing networks

Presents an algorithm that allows the computer automation of the analysis of the stability of re-entrant lines. Through various examples, it is suggested that this method may completely characterise the region of stability for the types of networks considered. For the class of non-idling and buffer priority policies, piecewise linear functions of low complexity are constructed. To construct such functions for other policies such as FIFO appears to be more difficult in general, due to the complex state representation of such models.<>