Elsevier

Information and Computation

Volume 75, Issue 3, December 1987, Pages 289-327
Information and Computation

The pursuit of deadlock freedom

https://doi.org/10.1016/0890-5401(87)90004-6Get rights and content
Under an Elsevier user license
open archive

Abstract

We introduce some combinatorial techniques for establishing the deadlock freedom of concurrent systems which are similar to the variant/invariant method of proving loop termination. Our methods are based on the local analysis of networks, which is combinatorially far easier than analysing all global states. They are illustrated by proving numerous examples to be free of deadlock, some of which are useful classes of network.

Cited by (0)