Deadlocks and dihomotopy in mutual exclusion models

Theoretical Computer Science

Volumn 365, Issue 3, 2006, Pages 247-257

  Raußen, Martin ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

Deadlock detection; Dihomotopy; Mutual exclusion

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; TOPOLOGY;

DEADLOCK DETECTION; DIHOMOTOPY; HIGHER DIMENSIONAL AUTOMATA (HDA); MUTUAL EXCLUSION;

COMPUTER SYSTEM RECOVERY;

EID: 33750065437     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.052     Document Type: Article

References (18)

1. Carson S.D., and Reynolds P.F. The geometry of semaphore programs. ACM TOPLAS 9 1 (1987) 25-53
2. Dijkstra E.W. Co-operating sequential processes. In: Genuys F. (Ed). Programming Languages (1968), Academic Press, New York 43-110
3. Fajstrup L. Discovering spaces. Homology, Homotopy, Appl. 5 2 (2003) 1-17
4. Fajstrup L. Dipaths and dihomotopies in a cubical complex. Adv. in Appl. Math. 35 (2005) 188-206
5. Fajstrup L., Goubault E., Haucourt E., and Raussen M. Components of the fundamental category. Appl. Categ. Structures 12 1 (2004) 81-108
6. L. Fajstrup, É. Goubault, M. Raussen, Detecting deadlocks in concurrent systems, in: D. Sangiorgi, R. de Simone (Eds.), CONCUR '98; Concurrency Theory (Nice, France), Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, September 1998, Ninth Internat. Conf., Proceedings, pp. 332-347.
7. L. Fajstrup, É. Goubault, M. Raussen, Algebraic topology and concurrency, Theoret. Comput. Sci. 357 (2006) 241-278.
8. L. Fajstrup, S. Sokołowski, Infinitely running concurrent processes with loops from a geometric viewpoint, Electronic Notes Theoretical Computer Science, Vol. 39, Springer, Berlin, no. 2, 2000, 19pp., URL: http://www.elsevier.nl/locate/entcs/volume39.html.
9. É. Goubault, The geometry of concurrency, Ph.D. Thesis, Ecole Normale Superieure, Paris, 1995.
10. Goubault E. Geometry and concurrency: a user's guide. Math. Structures Comput. Sci. 10 4 (2000) 411-425
11. É. Goubault, Géométrie du Parallelisme, Analyse Statique et Autres Applications, Mémoire d' habilitation à diriger les recherches, DEIN/SLA, CEA/Saclay, F-91191 Gif-sur-Yvette, France, 2001.
12. Goubault E. Some geometric perspectives in concurrency theory. Homology, Homotopy, Appl. 5 2 (2003) 95-136
13. É. Goubault, M. Raussen, Dihomotopy as a tool in state space analysis, in: S. Rajsbaum (Ed.), LATIN 2002: Theoretical Informatics, Cancun, Mexico, April 2002, Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, Proceedings, pp. 16-37.
14. Grandis M. Directed directed homotopy theory I. The fundamental category. Cahiers Topologie Géom. Différentielle Catégoriques 44 (2003) 281-316
15. Gunawardena J. Homotopy and concurrency. Bull. EATCS 54 (1994) 184-193
16. V. Pratt, Modelling concurrency with geometry, Proc. 18th ACM Symp. on Principles of Programming Languages, 1991, pp. 311-322.
17. Raussen M. On the classification of dipaths in geometric models for concurrency. Math. Struct. Comput. Sci. 10 4 (2000) 427-457
18. Raussen M. State spaces and dipaths up to dihomotopy. Homology, Homotopy, Appl. 5 2 (2003) 257-280