Deadlocks and dihomotopy in mutual exclusion models

Authors:
Martin Raußen
Affiliations:
Department of Mathematical Sciences, Aalborg University, Aalborg Øst, Denmark
Venue:
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Year:
2006

Citing 7
Cited 0

The geometry of semaphore programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling concurrency with geometry

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dihomotopy as a Tool in State Space Analysis

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Detecting Deadlocks in Concurrent Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Geometry and concurrency: a user's guide

Mathematical Structures in Computer Science
On the classification of dipaths in geometric models for concurrency

Mathematical Structures in Computer Science
Algebraic topology and concurrency

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Higher dimensional automata (HDA) represent a promising tool for modelling ("true") concurrency in a both combinatorial and topological framework. Within these models, fast algorithms investigating deadlocks and unreachable regions have been devised previously on a background of easily understandable "directed" geometric ideas. In this article, we modify notions and methods from homotopy theory to define and investigate "essentially different" schedules in a HDA and to detect whether two given runs are essentially different using an algorithm again based on "directed geometry".