In: Comput. Syst. Sci. Eng., Vol. 3, No. 2, pages 67-82. April 1988.
Abstract: There are instances in real-time applications where several distributed processes compete for access to a shared resource. Major concerns with these problems are deadlock and decentralization. Two synchronization mechanisms are presented which address these issues. Both mechanisms are proven to be deadlock-free by demonstrating the liveness property of the corresponding Petri net used to model the problem.