Back to Search
Start Over
Deadlocks and dihomotopy in mutual exclusion models
- Source :
-
Theoretical Computer Science . Nov2006, Vol. 365 Issue 3, p247-257. 11p. - Publication Year :
- 2006
-
Abstract
- 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”. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*MATHEMATICAL logic
*MATHEMATICAL models
*RECURSIVE functions
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 365
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 22797094
- Full Text :
- https://doi.org/10.1016/j.tcs.2006.07.052