Algebraic topology and concurrency

Theoretical Computer Science

Volumn 357, Issue 1-3, 2006, Pages 241-278

  Fajstrup, Lisbeth ^a   Raußen, Martin ^a   Goubault, Eric ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b DIF   (France)

Author keywords

Concurrency; Cubical set; Higher dimensional automata; Homotopy; Partial order; Partially ordered space

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; CONCURRENCY CONTROL; DATABASE SYSTEMS; ELECTRIC NETWORK TOPOLOGY; SEMANTICS;

CUBICAL SET; HIGHER-DIMENSIONAL AUTOMATA; HOMOTOPY; PARTIAL ORDER; PARTIALLY ORDERED SPACE;

LINEAR ALGEBRA;

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

References (81)

1. Attiya H., and Friedman R. A correctness condition for high-performance multiprocessors. Proc. 24th STOC (1992), ACM Press, New York
2. Arnold A. Systèmes de transitions finis et sémantique des processus communicants (1992), Masson
3. Attiya H., Bar-Noy A., Dolev D., Peleg D., and Reischuk R. Renaming in an asynchronous environment. J. ACM 37 3 (1990) 524-548
4. M.A. Bednarczyk, Categories of asynchronous systems, Ph.D. Thesis, University of Sussex, 1988.
5. E. Borowsky, Capturing the power of resiliency and set consensus in distributed systems, Technical Report, University of California in Los Angeles, 1995.
6. Borowsky E., and Gafni E. Generalized FLP impossibility result for t-resilient asynchronous computations. Proc. 25th STOC (1993), ACM Press, New York
7. Brown R., and Higgins P.J. On the algebra of cubes. J. Pure Appl. Algebra 21 (1981) 233-260
8. Brown R., and Higgins P.J. Colimit theorems for relative homotopy groups. J. Pure Appl. Algebra 22 (1981) 11-41
9. R. Buckland, M. Johnson, ECHIDNA: a system for manipulating explicit choice higher dimensional automata, in: AMAST'96: Fifth Internat. Conf. on Algebraic Methodology and Software Technology, Munich, 1996.
10. Carson S.D., and Reynolds Jr. P.F. The geometry of semaphore programs. ACM Trans. Programming Languages Systems 9 1 (1987) 25-53
11. Chaudhuri S. Agreement is harder than consensus: set consensus problems in totally asynchronous systems. Proc. Ninth Annu. ACM Symp. on Principles of Distributed Computing (1990), ACM Press, New York 311-334
12. Cridlig R. Semantic analysis of shared-memory concurrent languages using abstract model-checking. Proc. PEPM'95 (1995), ACM Press, La Jolla
13. R. Cridlig, Semantic analysis of concurrent ML by abstract model-checking, in: Proc. LOMAPS Workshop, 1996.
14. Cridlig R., and Goubault E. Semantics and analyses of Linda-based languages. in: Proc. WSA'93, Lecture Notes in Computer Science Vol. 724 (1993), Springer, Berlin
15. Dijkstra E. Cooperating Sequential Processes (1968), Academic Press, New York
16. A. Dold, Lectures on Algebraic Topology, second ed., Grundlehren der Matematischen Wissenschaften, Vol. 200, Springer, Berlin, 1980.
17. U. Fahrenberg, The geometry of timed PV-programs, Electronic Notes in Computer Science, Vol. 81, 2003, pp. 1-14.
18. Fajstrup L. Dicovering spaces. Homology Homotopy Appl. 5 2 (2003) 1-17
19. L. Fajstrup, Dipaths and dihomotopies in a cubical complex, Adv. Appl. Math. 35 (2) (2005) R-2003-22.
20. Fajstrup L., Goubault E., Haucourt E., and Raussen M. Components of the fundamental category. Appl. Categ. Structures 12 1 (2004) 81-108
21. L. Fajstrup, E. Goubault, M. Raussen, Detecting deadlocks in concurrent systems, in: D. Sangiorgi, R. de Simone (Eds.), CONCUR '98; Concurrency Theory, Lecture Notes in Computer Science, Vol. 1466, Springer, Nice, France, Ninth Internat. Conf., Proceedings, 1998, pp. 332-347.
22. D.R. Farkas, The Anick resolution, J. Pure Appl. Algebra 79 (1992) 159-168.
23. Fiore M., Plotkin G., and Power J. Complete cuboidal sets in axiomatic domain theory (extended abstract). Proc. 12th Annu. IEEE Symp. on Logic in Computer Science (1997), IEEE Computer Society Press, Warsaw, Poland 268-279
24. Fisher M., Lynch N.A., and Paterson M.S. Impossibility of distributed commit with one faulty process. J. ACM 32 2 (1985) 374-382
25. P. Gaucher, Connexion de flux d'information en algèbre homologique, Technical Report, IRMA, Strasbourg, available at 〈http://irmasrv1.u-strasbg.fr/∼gaucher/activite.html〉, 1997.
26. P. Gaucher, Etude homologique des chemins de dimension 1 d'un automate, Technical Report, IRMA, Strasbourg, available at 〈http://irmasrv1.u-strasbg.fr/∼gaucher/activite.html〉, 1997.
27. Gaucher P. Homotopy invariants of higher dimensional categories and concurrency in computer science. Math. Structures Comput. Sci. 10 4 (2000) 481-524
28. P. Gaucher, A convenient category for the homotopy theory of concurrency, Technical Report, math.AT/0201252, 2002, 138pp.
29. P. Gaucher, From concurrency to algebraic topology, Electronic Notes in Computer Science, Vol. 39 (2), 2001, pp. 1-19.
30. P. Gaucher, E. Goubault, Topological deformation of higher dimensional automata, Technical Report, arXiv:math.AT/010760, 2001.
31. Gierz G., Hofmann K.H., Keimel K., Lawson J.D., Mislove M., and Scott D.S. A Compendium of Continuous Lattices (1980), Springer, Berlin, Heidelberg, New York
32. R. van Glabbeek, Bisimulation semantics for higher dimensional automata, Technical Report, Stanford University, Manuscript available on the web as 〈http://theory.stanford.edu/∼rvg/hda〉 1991.
33. Goubault E. Domains of higher-dimensional automata. Proc. CONCUR'93 (1993), Springer, Hildesheim
34. E. Goubault, The geometry of concurrency, Ph.D. Thesis, Ecole Normale Supérieure Paris, available at 〈http://www.dmi.ens.fr/∼goubault〉, 1995.
35. E. Goubault, Schedulers as abstract interpretations of HDA, in: Proc. PEPM'95, ACM Press, New York, also available at 〈http://www.dmi.ens.fr/∼goubault〉, La Jolla, 1995.
36. E. Goubault, Durations for truly-concurrent actions, in: Proc. ESOP'96, no. 1058, Springer, Berlin, 1996, pp. 173-187.
37. E. Goubault, The dynamics of wait-free distributed computations, Technical Report, Research Report LIENS-96-26, December 1996.
38. E. Goubault, A semantic view on distributed computability and complexity, in: Proc. Third Theory and Formal Methods Section Workshop, Imperial College Press, also available at 〈http://www.dmi.ens.fr/∼goubault〉, 1996.
39. Goubault E. Optimal implementation of wait-free binary relations. Proc. 22nd CAAP (1997), Springer, New York
40. E. Goubault, Cubical sets are generalized transition systems, Technical Report, Pre-proceedings of CMCIM'02, also available at 〈http://www.di.ens.fr/∼goubault〉, 2001.
41. Goubault E. Some geometric perspectives in concurrency theory. Homology Homotopy Appl. 5 2 (2003) 95-136
42. Goubault E., and Jensen T.P. Homology of higher-dimensional automata. Proc. CONCUR'92 (1992), Springer, Stonybrook, New York
43. Goubault E., and Raussen M. Dihomotopy as a tool in state space analysis. In: Rajsbaum S. (Ed). LATIN 2002: Theoretical informatics, Lecture Notes in Computer Science Vol. 2286 (2002), Springer, Cancun, Mexico 16-37
44. E. Goubault, M. Raussen, Dihomotopy as a tool in state space analysis, in: Proc. LATIN'02, 2002.
45. Grandis M. Directed homotopy theory II. Homotopy constructs. Theory Appl. Categ. 10 14 (2002) 369-391
46. M. Grandis, Directed homotopy theory I. The fundamental category, Cahiers Topologie Géom. Différentielle Catégoriques (2003) 281-316.
47. Groves J.R.J. Rewriting systems and homology of groups. In: Kovacs L.G. (Ed). Groups-Canberra 1989, Lecture Notes in Mathematics Vol. 1456 (1991), Springer, Berlin 114-141
48. Gunawardena J. Homotopy and concurrency. Bull. EATCS 54 (1994) 184-193
49. Harcourt E., Mauney J., and Cook T. From processor timing specifications to static instruction scheduling. Proc. Static Analysis Symp.'94, Lecture Notes in Computer Science (1994), Springer, Berlin
50. M. Herlihy, A tutorial on algebraic topology and distributed computation, Technical Report, Presented at UCLA, 1994.
51. Herlihy M., and Rajsbaum S. Set consensus using arbitrary objects. Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing (1994), ACM Press, New York
52. M. Herlihy, S. Rajsbaum, Algebraic topology and distributed computing, a primer, Technical Report, Brown University, 1995.
53. Herlihy M., and Shavit N. The asynchronous computability theorem for t-resilient tasks. Proc. 25th STOC (1993), ACM Press, New York
54. Herlihy M., and Shavit N. A simple constructive computability theorem for wait-free computation. Proc. STOC'94 (1994), ACM Press, New York
55. J. Jardine, Cubical homotopy theory: a beginning, Technical Report NI02030-NST, Isaac Newton Institute, Cambridge, UK, 2002.
56. Jayanti P. On the robustness of Herlihy's hierarchy. Proc. 12th Annu. ACM Symp. on Principles of Distributed Computing (1993), Ithaca, New York, USA 145-157
57. Jayanti P. Robust wait-free hierarchies. J. ACM 44 4 (1997) 592-614
58. Kobayashi Y. Complete rewriting systems and homology of monoid algebras. J. Pure Appl. Algebra 65 (1990) 263-275
59. E. Lanzmann, Automates d'ordre supérieur, Master's Thesis, Université d'Orsay, 1993.
60. Lynch N. Distributed Algorithms (1996), Morgan Kaufmann, Los Altos, CA
61. A. Mazurkiewicz, Basic notions of trace theory, in: Lecture Notes for the REX Summer School in Temporal Logic, Springer, Berlin, 1988.
62. F. Morace, Finitely presented categories and homology, Technical Report, Université Joseph Fourier, 1995.
63. Nachbin L. Topology and Order (1965), Van Nostrand, Princeton
64. R. Penrose, Techniques of Differential Topology in Relativity, Conference Board of the Mathematical Sciences, Vol. 7, Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, USA, 1972.
65. Pratt V. Modeling concurrency with geometry. Proc. 18th ACM Symp. on Principles of Programming Languages (1991), ACM Press, New York
66. Proebsting T.A., and Fraser C.W. Detecting pipeline structural hazards quickly. Proc. Symp. on Principles of Programming Languages (1994), ACM Press, New York
67. Raussen M. On the classification of dipaths in geometric models for concurrency. Math. Structures Comput. Sci. 10 4 (2000) 427-457
68. Raussen M. State spaces and dipaths up to dihomotopy. Homology Homotopy Appl. 5 2 (2003) 257-280
69. Saks M., and Zaharoglou F. Wait-free k-set agreement is impossible: the topology of public knowledge. Proc. 25th STOC (1993), ACM Press, New York
70. V. Sassone, G.L. Cattani, Higher-dimensional transition systems, in: Proc. LICS'96, 1996.
71. Schenk E. The consensus hierarchy is not robust. Proc. 16th Annu. ACM Symp. on Principles of Distributed Computing (1997), Santa Barbara, California 279
72. J. Serre, Homologie singulière des espaces fibrés applications, Ph.D. Thesis, Ecole Normale Supérieure, 1951.
73. S. Sokolowski, Homotopy in concurrent processes, Technical Report, Institute of Computer Science, Gdansk Division, 1998.
74. S. Sokolowski, Investigation of concurrent processes by means of homotopy functors, Technical Report, Institute of Computer Science, Gdansk Division, 1998.
75. S. Sokolowski, Point glueing in cpo-s, Technical Report, Institute of Computer Science, Gdansk Division, 1998.
76. S. Sokołowski, Classifying holes of arbitrary dimension in partially ordered cubes, Kansas State University, February 2000, Manuscript.
77. Squier C.C., Otto F., and Kobayashi Y. A finiteness condition for rewriting systems. Theoret. Comput. Sci. 131 (1994) 271-294
78. Stark A. Concurrent transition systems. Theoret. Comput. Sci. 64 (1989) 221-269
79. Y. Takayama, Towards Cycle Filling as Parallelization, RIMS Workshop on Concurrency Theory and Applications 96, RIMS Kyoto University, 1998.
80. Y. Takayama, Extraction of concurrent processes from higher-dimensional automata, in: Proc. CAAP'96, 1996, pp. 72-85.
81. G. Winskel, M. Nielsen, Models for concurrency, Handbook of Logic in Computer Science, Vol. 3, Oxford University Press, Oxford, 1994, pp. 100-200.