Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T21:20:36.817Z Has data issue: false hasContentIssue false
  • English
  • Français

Loops, ditopology and deadlocks

Published online by Cambridge University Press:  01 August 2000

LISBETH FAJSTRUP
LISBETH FAJSTRUP
Affiliation:
Department of Mathematical Sciences, Aalborg University, Fredrik Bajers Vej 7E, DK - 9220 Aalborg Ø. Email: fajstrup@math.auc.dk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 10 , Issue 4 , August 2000 , pp. 459 - 480
Copyright
2000 Cambridge University Press