The Solution of Mutual Exclusion Problems which can be Described Graphically. - Ivor P. Page; R. T. Jacob (Comput. J., 1989)

Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores. - R. T. Jacob; Ivor P. Page (IEEE Trans. Software Eng., 1989)

Variations on the drinking philosophers algorithm. - S. E. Chern; R. T. Jacob; Ivor P. Page (SPDP, 1990)

An Efficient Starvation-Free Semaphore Solution for the Graphical Mutual Exclusion Problem. - Kwok-Bun Yue; R. T. Jacob (Comput. J., 1991)

An Optimal Algorithm for Reducing Edge-Solvable Mutual Exclusion Graphs. - Kwok-Bun Yue; R. T. Jacob (Comput. J., 1994)