The need for arbitration arises whenever a resource is shared by independent contending users. This paper considers the two new arbitratin techniques, namely, timeout and batching arbitratina and establishes the validity of their operations using generalised and deterministic petri net models. After a brief review of petri net theory and the fundamentals of generalised and determinic models. Petri net models for the timeout ang batching arbitratin schemes are prsented, followed by a discussion on the simulation results of both these schemes. It is found that both arbitration schemes provide a degree of fairness in that they reduce the resource allocation time but at the lack of complete resource utilisatin . A hybrid scheme which combines the key features of both batching and timeout schemes is then presented and proven to operate correctly simulation of this scheme suggests that by varying the arbiter parameter in conjuction with the priority of the processors, efficient allocation of system resources can be archieved