License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04351.12
URN: urn:nbn:de:0030-drops-1364
Go to the corresponding Portal

Raussen, Martin

Deadlocks and Dihomotopy in Mutual Exclusion Models

04351.RaussenMartin.ExtAbstract.136.pdf (0.2 MB)


Parallel processes in concurrency theory can be modelled in a geometric framework. A convenient model are the Higher Dimensional Automata of V. Pratt and E. Goubault with cubical complexes as their mathematical description. More abstract models are given by (locally) partially ordered topological spaces, the directed ($d$-spaces) of
M.Grandis and the flows of P. Gaucher. All models invite to use or modify ideas from algebraic topology, notably homotopy.

In specific semaphore models for mutual exclusion, we have developed methods and algorithms that can detect deadlocks and unsafe regions and give information about essentially different schedules using higher dimensional ``geometric'' representations of the state space and executions (directed paths) along it.

BibTeX - Entry

  author =	{Raussen, Martin},
  title =	{{Deadlocks and Dihomotopy in Mutual Exclusion Models}},
  booktitle =	{Spatial Representation: Discrete vs. Continuous Computational Models},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4351},
  editor =	{Ralph Kopperman and Michael B. Smyth and Dieter Spreen and Julian Webster},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-1364},
  doi =		{10.4230/DagSemProc.04351.12},
  annote =	{Keywords: Mutual exclusion , deadlock detection , dihomotopy}

Keywords: Mutual exclusion , deadlock detection , dihomotopy
Collection: 04351 - Spatial Representation: Discrete vs. Continuous Computational Models
Issue Date: 2005
Date of publication: 22.04.2005

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI