Geometry and concurrency: A user's guide

Mathematical Structures in Computer Science

Volumn 10, Issue 4, 2000, Pages 411-425

  Goubault†, Eric ^a  

^a CEA LETI   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84985970967     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500003133     Document Type: Article

References (79)

1. Anick, D. J. (1986) On the homology of associative algebras. Transactions of the American Mathe-matical Society 296 641–659.
2. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D. and Reischuk, R. (1990) Renaming in an asynchronous environment. Journal of the ACM 37 (3) 524–548.
3. Baues, H. J. (1989) Algebraic homotopy. Cambridge Studies in Advanced Mathematics 15, Cambridge University Press.
4. Bednarczyk, M. A. (1988) Categories of asynchronous systems, Ph. D. thesis, University of Sussex.
5. Biran, O., Moran, S. and Zaks, S. (1988) A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In: Proc. 7th Annual ACM Symposium on Principles of Distributed Computing, ACM Press 263–275.
6. Borowsky, E. and Gafni, E. (1993) Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proc. of the 25th STOC, ACM Press.
7. Brown, R. and Higgins, P. J. (1981a) Colimit theorems for relative homotopy groups. Journal of Pure and Applied Algebra 22 11–41.
8. Brown, R. and Higgins, P. J. (1981b) On the algebra of cubes. Journal of Pure and Applied Algebra 21 233–260.
9. Buckland, R. and Johnson, M. (1996) ECHIDNA: A system for manipulating explicit choice higher dimensional automata. In: AMAST’96: Fifth Int. Conf. on Algebraic Methodology and Software Technology, Munich.
10. Burroni, A. (1991) Higher dimensional word problem. Springer-Verlag Lecture Notes in Computer Science 530.
11. Carson, S. D. and Reynolds Jr, P. F. (1987) The geometry of semaphore programs. ACM Transactions on Programming Languages and Systems 9 (1) 25–53.
12. Chaudhuri, S. (1990) Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: Proc. of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM Press 311–334.
13. Coffman, E. G., Elphick, M.J. and Shoshani, A. (1971) System deadlocks. Computing Surveys 3 (2) 67–78.
14. Cousot, P. and Cousot, R. (1977) Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages 4 238–252.
15. Cridlig, R. (1995) Semantic analysis of shared-memory concurrent languages using abstract model-checking. In: Proc. of PEPM’95, La Jolla, ACM Press.
16. Cridlig, R. (1996) Semantic analysis of Concurrent ML by abstract model-checking. In: Proceedings of the LOMAPS Workshop.
17. Cridlig, R. and Goubault, E. (1993) Semantics and analyses of Linda-based languages. In: Proc. of WSA’93. Springer-Verlag Lecture Notes in Computer Science 724. Dijkstra, E. (1968) Cooperating Sequential Processes, Academic Press.
18. Fajstrup, L., Goubault, E. and Raussen, M. (1998) Detecting deadlocks in concurrent systems. In: Proceedings of the 9th International Conference on Concurrency Theory, Springer-Verlag (also available at http://www.dmi.ens.fr/_goubault).
19. Fajstrup, L., Goubault, E. and Raussen, M. (1999) Algebraic topology and concurrency. Theoretical Computer Science (submitted) (also technical report, Aalborg University).
20. Fajstrup, L. and Raussen, M. (1996) Detecting Deadlocks in Concurrent Systems. Technical report, BRICS Research Report, Aalborg University.
21. Farkas, D. R. (1992) The Anick resolution. Journal of Pure and Applied Algebra 79.
22. Fiore, M., Plotkin, G. and Power, J. (1997) Complete cuboidal sets in axiomatic domain theory (extended abstract). In: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, IEEE Computer Society Press 268–279.
23. Fisher, M., Lynch, N. A. and Paterson, M. S. (1985) Impossibility of distributed commit with one faulty process. Journal of the ACM 32 (2) 374–382.
24. Gabriel, P. and Zisman, M. (1967) Calculus of fractions and homotopy theory. In: Ergebnisse der Mathematik und ihrer Grenzgebiete 35, Springer-Verlag.
25. Gaucher, P. (1997a) Connexion de flux d'information en algebre homologique. Technical report, IRMA, Strasbourg, available at http://irmasrvl.u-strasbg.fr/_gaucher
26. Gaucher, P. (1997b) Etude homologique des chemins de dimension 1 d’un automate. Technical report, IRMA, Strasbourg, available at http://irmasrvl.u-strasbg.fr/_gaucher
27. Godefroid, P. and Wolper, P. (1991) Using partial orders for the efficient verification of deadlock freedom and safety properties. In: Proc. of the Third Workshop on Computer Aided Verification. Springer-Verlag Lecture Notes in Computer Science 575 417–428.
28. Goubault, E. (1993) Domains of higher-dimensional automata. In: Proc. of CONCUR’93, Hildesheim, Springer-Verlag.
29. Goubault, E. (1995a) The Geometry of Concurrency, Ph. D. thesis, Ecole Normale Superieure (also available at http: //www.dmi.ens.fr/_goubault)
30. Goubault, E. (1995b) Schedulers as abstract interpretations of HDA. In: Proc. of PEPM’95, La Jolla, ACM Press (also available at http://www.dmi.ens.fr/_goubault)
31. Goubault, E. (1996a) The Dynamics of Wait-Free Distributed Computations. Technical report, Research Report LIENS-96-106.
32. Goubault, E. (1996b) A semantic view on distributed computability and complexity. In :Proceedings of the 3rd Theory and Formal Methods Section Workshop, Imperial College Press (also available at http://www.dmi.ens.fr/_goubault).
33. Goubault, E. (1997) Optimal implementation of wait-free binary relations. In: Proceedings of the 22nd CAAP, Springer-Verlag.
34. Goubault, E. and Jensen, T.P. (1992) Homology of higher-dimensional automata. In: Proc. of CONCUR’92, Stonybrook, New York, Springer-Verlag.
35. Goubault-Larrecq, J. and Goubault, E. (1999) Order-theoretic, geometric and combinatorial models of intuitionistic s4 proofs. In: proceedings of IMLA’99.
36. Groves, J. R. J. (1991) Rewriting systems and homology of groups. In: Kovacs, L. G. (Ed.) Groups - Canberra 1989. Springer-Verlag Lecture Notes in Mathematics 1456 114–141.
37. Gunawardena, J. (1994) Homotopy and concurrency. In: Bulletin of the EATCS 54 184–193.
38. Herlihy, M. and Rajsbaum, S. (1994) Set consensus using arbitrary objects. In: Proc. of the 13th Annual ACM Symposium on Principles of Distributed Computing, ACM Press.
39. Herlihy, M. and Rajsbaum, S. (1995) Algebraic spans (preliminary version). In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada 90–99. Herlihy, M. and Rajsbaum, S. (1999) New perspectives in distributed computing. In: Kutylowski, M., Pacholski, L. and Wierzbicki, T. (eds.) 24th International Symposium on Mathematical Foundations of Computer Science. Springer-Verlag Lecture Notes in Computer Science 1672 170-186.
40. Herlihy, M. and Shavit, N. (1993) The asynchronous computability theorem for t-resilient tasks. In: Proc. of the 25th STOC, ACM Press.
41. Herlihy, M. and Shavit, N. (1994) A simple constructive computability theorem for wait-free computation. In: Proceedings of STOC’94, ACM Press.
42. Jayanti, P. (1993) On the robustness of Herlihy's hierarchy. In: Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, Ithaca, New York 145–157.
43. Jayanti, P. (1997) Robust wait-free hierarchies. Journal of the ACM 44 (4) 592–614.
44. Kahn, G. (1974) The semantics of a simple language for parallel programming. Information Processing 74.
45. Kahn, G. and MacQueen, D. B. (1977) Coroutines and networks of parallel processes. Information Processing 77.
46. Kobayashi, Y. (1990) Complete rewriting systems and homology of monoid algebras. Journal of Pure and Applied Algebra 65 263–275.
47. Lafont, Y. and Proute, A. (1990) Church-Rosser Property and Homology of Monoids. Technical report, Ecole Normale Superieure.
48. Lanzmann, E. (1993) Automates d’ordre superieur, Master’s thesis, Universite d’Orsay.
49. Levy, J.-J. (1978) Reductions Correctes et Optimales dans le Lambda-Calcul, Ph. D. thesis, Universite Paris VII.
50. Lipski and Papadimitriou (1981) A fast algorithm for testing for safety and detecting deadlocks in locked transaction. ALGORITHMS: Journal of Algorithms.
51. Lynch, N. (1996) Distributed Algorithms, Morgan-Kaufmann.
52. Mac Lane, S. (1963) Homology. In: Die Grundlehren der Mathematischen Wissenschaften in Einzel-darstellungen 114, Springer Verlag.
53. May, J. P. (1967) Simplicial objects in algebraic topology, van Nostrand.
54. Mazurkiewicz, A. (1986) Trace theory. In: Rozenberg, G. (ed.) Petri Nets: Applications and Relationship to Other Models of Concurrency, Advances in Petri Nets 1986, PART II, PO of an Advanced Course. Springer-Verlag Lecture Notes in Computer Science 255 279–324.
55. Papadimitriou, C. H. (1979) The serializability of concurrent database updates. Journal of the ACM 26 (4) 631–653.
56. Papadimitriou, C. H. (1983) Concurrency control by locking. SIAM Journal on Computing 12 (2) 215–226.
57. Penrose, R. (1972) Techniques of Differential Topology in Relativity. Conference Board of the Mathematical Sciences, Regional Conference Series in Applied Mathematics 7, SIAM.
58. Pratt, V. (1991) Modeling concurrency with geometry. In: Proc. of the 18th ACM Symposium on Principles of Programming Languages, ACM Press.
59. Pratt, V. (1999) Chu spaces. In: Course notes for the School in Category Theory and Applications, Coimbra, Portugal.
60. Preparata, F. P. and Shamos, M. I. (1993) Computational Geometry, an Introduction, Springer-Verlag.
61. Saks, M. and Zaharoglou, F. (1993) Wait-free k-set agreement is impossible: The topology of public knowledge. In: Proc. of the 25th STOC, ACM Press.
62. Sassone, V. and Cattani, G.L. (1996) Higher-dimensional transition systems. In: Proceedings of LICS'96.
63. Sassone, V., Nielsen, M. and Winskel, G. (1994) Relationships between models of concurrency. In: Proceedings of the Rex’93 school and symposium. Schenk, E. The consensus hierarchy is not robust. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California 279.
64. Shields, M. (1985) Concurrent machines. Computer Journal 28.
65. Shoshani, A. and Coffman, E. G. (1970) Sequencing tasks in multiprocess systems to avoid deadlocks. In: Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, Santa Monica, California, IEEE 225–235.
66. Soisalon-Soininen, E. and Wood, D. (1985) An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems. In: Symposium on Principles of Database Systems (PODS'82) 108–116.
67. Sokolowski, S. (1998a) Homotopy in concurrent processes. Technical report, Institute of Computer Science, Gdansk Division.
68. Sokolowski, S. (1998b) Investigation of concurrent processes by means of homotopy functors. Technical report, Institute of Computer Science, Gdansk Division.
69. Sokolowski, S. (1998c) Point glueing in cpo-s. Technical report, Institute of Computer Science, Gdansk Division.
70. Spanier, E. J. (1966) Algebraic Topology, McGraw Hill.
71. Squier, C. C., Otto, F. and Kobayashi, Y. (1994) A finiteness condition for rewriting systems. Theoretical Computer Science 131 271–294.
72. Stark, A. (1989) Concurrent transition systems. Theoretical Computer Science 64 221–269.
73. Takayama, Y. (1995) Cycle filling as parallelization with expansion law (submitted).
74. Takayama, Y. (1996) Extraction of concurrent processes from higher-dimensional automata. In: Proceedings of CAAP’96 72–85.
75. Valmari A. (1990) A stubborn attack on state explosion. In: Proc. of CAV’90. Springer-Verlag Lecture Notes in Computer Science.
76. van Glabbeek, R. (1991) Bisimulation Semantics for Higher Dimensional Automata. Technical report, Stanford University (also available at http://theory.stanford.edu/_rvg/had
77. van Glabbeek, R. and Goltz, U. (1989) Partial order semantics for refinement of actions. Bulletin of the EATCS 34.
78. Winskel, G. and Nielsen, M. (1994) Models for concurrency. Handbook of Logic in Computer Science 3, Oxford University Press.
79. Yannakakis, M., Papadimitriou, C.H. and Kung, H.T. (1979) Locking policies: Safety and freedom from deadlock. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, IEEE 286–297.