A Graph-Type Based Deadlock Detection Algorithm

An exact deadlock-detection algorithm for the synchronous process-calculus of Gay and Nagarajan is introduced and discussed. The algorithm is based on the categorical semantics of the calculus and associates graph-types with processes such that simple graph-theoretic properties of these types give exact information as to whether or not the corresponding processes deadlock.

Available upon request. Status: published.

$Id: index.html,v 1.3 2004/09/22 21:59:19 martinb Exp $