Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-26T07:46:18.743Z 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
Get access Rights & Permissions [Opens in a new window]

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)