On the classification of dipaths in geometric models for concurrency

Mathematical Structures in Computer Science

Volumn 10, Issue 4, 2000, Pages 427-457

  Raussen, Martin ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1342340490     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500003145     Document Type: Article

References (23)

1. Aparici, I. and Morezuelas, S. (1999) Detection rapide de points morts. Technical Report 99–156, CEA/LETI.
2. Brown, R. and Higgins, P. (1981a) Colimit theorems for relative homotopy groups. J. Pure Appl. Algebra 22 11–41.
3. Brown, R. and Higgins, P. (1981b) On the algebra of cubes. J. Pure Appl. Algebra 21 233–260. Carson, S. and Reynolds, P. (1987) The geometry of semaphore programs. ACM TOPLAS 9 (1) 25–53.
4. Dijkstra, E. (1968) Co-operating sequential processes. In: Genuys, F. (ed.) Programming Languages, Academic Press 43–110.
5. Dold, A. (1980) Lectures on Algebraic Topology. Grundlehren der matematischen Wissenschaften 200, Springer-Verlag (2nd edition).
6. Edelsbrunner, H. (1980) Dynamic data structures for orthogonal intersectin queries. Technical Report F59, Tech. Univ. Graz, Institut fiir Informationsverarbeitung.
7. Fajstrup, L. (1999) Loops, ditopology and deadlocks. Mathematical Structures in Computing Science, this issue.
8. Fajstrup, L., Goubault, E. and Raussen, M. (1998a) Detecting Deadlocks in Concurrent Systems. DTA/LETI/DEIN/SLA 98–101, LETI (CEA - Technologies Avancees), Saclay, France.
9. Fajstrup, L., Goubault, E. and Raussen, M. (1998b) Detecting Deadlocks In Concurrent Systems. In: Sangiorgi, D. and de Simone, R. (eds.) CONCUR ‘98; Concurrency Theory. Proceedings 9th Int. Conf., Nice, France. Springer-Verlag Lecture Notes in Computer Science 1466 332–347.
10. Fajstrup, L., Goubault, E. and Raussen, M. (1999) Algebraic topology and concurrency. Technical Report R-99-2008, Department of Mathematical Sciences, Aalborg University, DK-9220 Aalborg Øst.
11. Gierz, G., Hofmann, K., Keimel, K., Lawson, J., Mislove, M. and Scott, D. (1980) A Compendium of Continuous Lattices, Springer-Verlag.
12. Goubault, E. (1995) The Geometry of Concurrency, Ph. D. thesis, Ecole Normale Superieure, Paris.
13. Greenberg, M. J. and Harper, J. R. (1981) Algebraic Topology. A first Course. Mathematics Lecture Notes Series 58, Benjamin/Cummings, Reading, Mass.
14. Gunawardena, J. (1994) Homotopy and concurrency. Bulletin of the EATCS 54 184–193.
15. Lipski, W. and Papadimitriou, C. (1981) A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems. Journal of Algorithms 2 211–226.
16. Mazurkiewicz, A. (1988) Basic notions of trace theory. In: Lecture notes for the REX summer school in temporal logic, Springer-Verlag.
17. Penrose, R. (1972) Techniques of Differential Topology in Relativity. Conference Board of the Mathematical Sciences, Regional Conference Series in Applied Mathematics 7, SIAM.
18. Pratt, V. (1991) Modeling concurrency with geometry. Proc. of the 18th ACM Symposium on Principles of Programming Languages.
19. Preparata, F. and Shamos, M. (1988) Computational geometry, an introduction, Springer-Verlag.
20. Serre, J. P. (1951) Homologie singuliere des espaces fibres. Ann. of Math. 54 (2) 425–505.
21. Six, W. and Wood, D. (1982) Counting and reporting intersections of d-ranges. IEEE Transactions on computers 31 (3) 181–187.
22. van Glabbeek, R. (1991) Bisimulation semantics for higher dimensional automata. Technical report, Stanford University.
23. van Kreveld, M. and Overmars, M. (1993) Union-copy structures and dynamic segment trees. Journal of the Association for Computing Machinary 40 (3).