<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-14T04:52:52Z</responseDate>
  <request identifier="136" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:136</identifier>
        <datestamp>2024-03-06T10:05:51Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Deadlocks and Dihomotopy in Mutual Exclusion Models</dc:title>
          <dc:creator>Raussen, Martin</dc:creator>
          <dc:subject>Mutual exclusion</dc:subject>
          <dc:subject>deadlock detection</dc:subject>
          <dc:subject>dihomotopy</dc:subject>
          <dc:description>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&#13;
M.Grandis and the flows of P. Gaucher. All models invite to use or modify ideas from algebraic topology, notably homotopy.&#13;
&#13;
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.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Martin Raussen</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.04351.12</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1364</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.12</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
