Loops, ditopology and deadlocks
Lisbeth Fajstrup · Mathematical Structures in Computer Science · 2000
In Fajstrup et al. (1998a) the authors proposed a fast algorithm for deadlock detection, which was based on a geometric model of concurrency. We propose here an extension of this approach to deal with recursive processes (loops) and branchings.