@inproceedings{942a53f82d95422c9824b2a47301e8fb,
title = "Detecting deadlocks in concurrent systems",
abstract = "We study deadlocks using geometric methods based on generalized process graphs [Dij68], i.e., cubical complexes or Higher-Dimensional Automata (HDA) [Pra91,vG91,GJ92,Gun94], describing the semantics of the concurrent system of interest. A new algorithm is described and fully assessed, both theoretically and practically and compared with more well-known traversing techniques. An implementation is available, applied to a toy language. This algorithm not only computes the deadlocking states of a concurrent system but also the so-called {"}unsafe region{"} which consists of the states which will eventually lead to a deadlocking state. Its basis is a characterization of deadlocks using dual geometric properties of the {"}forbidden region{"}.",
author = "Lisbeth Fajstrup and Eric Goubault and Martin Rau{\ss}en",
note = "Publisher Copyright: {\textcopyright} 1998, Springer Verlag. All rights reserved.; 9th International Conference on Concurrency Theory, CONCUR 1998 ; Conference date: 08-09-1998 Through 11-09-1998",
year = "1998",
month = jan,
day = "1",
doi = "10.1007/bfb0055632",
language = "English",
isbn = "9783540648963",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "332--347",
editor = "Davide Sangiorgi and \{de Simone\}, Robert",
booktitle = "CONCUR 1998 Concurrency Theory - 9th International Conference, Proceedings",
}