In: Sangiorgi, D.; de Simone, R.: Lecture Notes in Computer Science, Vol. 1466: Proceedings 9th International Conference on Concurrency Theory (CONCUR'98), Nice, France, September 1998, pages 332-347. Springer-Verlag, 1998.
Abstract: The authors study deadlocks using geometric methods based on generalized process graphs, i.e. Higher-Dimensional Automata. An algorithm is presented that computes the deadlocking states and the unsafe region of the states that must lead to deadlock. The forbidden region is charactersized in terms of dual geometric properties.