Loops, ditopology and deadlocks
- 1 April 2000
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 10 (4) , 459-480
- https://doi.org/10.1017/s0960129500003157
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: