Previous Contents


[Anick, 1986]
Anick, D. J. (1986). On the homology of associative algebras. Transactions of the American Mathematical Society, 296:641--659.

[Attiya et al., 1990]
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.

[Bednarczyk, 1988]
Bednarczyk, M. A. (1988). Categories of asynchronous systems. PhD thesis, University of Sussex.

[Biran et al., 1988]
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, pages 263--275. ACM Press.

[Borowsky and Gafni, 1993]
Borowsky, E. and Gafni, E. (1993). Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. of the 25th STOC. ACM Press.

[Brown and Higgins, 1981a]
Brown, R. and Higgins, P. J. (1981a). Colimit theorems for relative homotopy groups. Journal of Pure and Applied Algebra, (22):11--41.

[Brown and Higgins, 1981b]
Brown, R. and Higgins, P. J. (1981b). On the algebra of cubes. Journal of Pure and Applied Algebra, (21):233--260.

[Buckland and Johnson, 1996]
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.

[Burroni, 1991]
Burroni, A. (1991). Higher dimensional word problem. Lecture notes in computer science, (530).

[Carson and Reynolds Jr, 1987]
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.

[Chaudhuri, 1990]
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, pages 311--334. ACM Press.

[Coffman et al., 1971]
Coffman, E. G., Elphick, M. J., and Shoshani, A. (1971). System deadlocks. Computing Surveys, 3(2):67--78.

[Cousot and Cousot, 1977]
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, pages 238--252.

[Cridlig, 1995]
Cridlig, R. (1995). Semantic analysis of shared-memory concurrent languages using abstract model-checking. In Proc. of PEPM'95, La Jolla. ACM Press.

[Cridlig, 1996]
Cridlig, R. (1996). Semantic analysis of Concurrent ML by abstract model-checking. In Proceedings of the LOMAPS Workshop.

[Cridlig and Goubault, 1993]
Cridlig, R. and Goubault, E. (1993). Semantics and analyses of Linda-based languages. In Proc. of WSA'93, number 724 in LNCS. Springer-Verlag.

[Dijkstra, 1968]
Dijkstra, E. (1968). Cooperating Sequential Processes. Academic Press.

[Fajstrup et al., 1998]
Fajstrup, L., Goubault, E., and Raussen, M. (1998). Detecting deadlocks in concurrent systems. In Proceedings of the 9th International Conference on Concurrency Theory, also available at Springer-Verlag.

[Fajstrup et al., 1999]
Fajstrup, L., Goubault, E., and Raussen, M. (1999). Algebraic topology and concurrency. submitted to Theoretical Computer Science, also technical report, Aalborg University.

[Fajstrup and Raussen, 1996]
Fajstrup, L. and Raussen, M. (1996). Detecting deadlocks in concurrent systems. Technical report, BRICS Research Report, Aalborg University.

[Farkas, 1992]
Farkas, D. R. (1992). The Anick resolution. Journal of Pure and Applied Algebra, 79.

[Fiore et al., 1997]
Fiore, M., Plotkin, G., and Power, J. (1997). Complete cuboidal sets in axiomatic domain theory (extended abstract). In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 268--279, Warsaw, Poland. IEEE Computer Society Press.

[Fisher et al., 1985]
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.

[Gaucher, 1997a]
Gaucher, P. (1997a). Connexion de flux d'information en algèbre homologique. Technical report, IRMA, Strasbourg, available at

[Gaucher, 1997b]
Gaucher, P. (1997b). Etude homologique des chemins de dimension 1 d'un automate. Technical report, IRMA, Strasbourg, available at

[Godefroid and Wolper, 1991]
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, volume 575, pages 417--428. Springer-Verlag, Lecture Notes in Computer Science.

[Goubault, 1993]
Goubault, E. (1993). Domains of higher-dimensional automata. In Proc. of CONCUR'93, Hildesheim. Springer-Verlag.

[Goubault, 1995a]
Goubault, E. (1995a). The Geometry of Concurrency. PhD thesis, Ecole Normale Supérieure. also available at

[Goubault, 1995b]
Goubault, E. (1995b). Schedulers as abstract interpretations of HDA. In Proc. of PEPM'95, La Jolla. ACM Press, also available at

[Goubault, 1996a]
Goubault, E. (1996a). The dynamics of wait-free distributed computations. Technical report, Research Report LIENS-96-26.

[Goubault, 1996b]
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

[Goubault, 1997]
Goubault, E. (1997). Optimal implementation of wait-free binary relations. In Proceedings of the 22nd CAAP. Springer Verlag.

[Goubault and Jensen, 1992]
Goubault, E. and Jensen, T. P. (1992). Homology of higher-dimensional automata. In Proc. of CONCUR'92, Stonybrook, New York. Springer-Verlag.

[Goubault-Larrecq and Goubault, 1999]
Goubault-Larrecq, J. and Goubault, E. (1999). Order-theoretic, geometric and combinatorial models of intuitionistic s4 proofs. In proceedings of IMLA'99.

[Groves, 1991]
Groves, J. R. J. (1991). Rewriting systems and homology of groups. In Kovacs, L. G., editor, Groups -- Canberra 1989, number 1456, pages 114--141. Lecture notes in Mathematics, Springer-Verlag.

[Gunawardena, 1994]
Gunawardena, J. (1994). Homotopy and concurrency. In Bulletin of the EATCS, number 54, pages 184--193.

[Herlihy and Rajsbaum, 1994]
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.

[Herlihy and Rajsbaum, 1995]
Herlihy, M. and Rajsbaum, S. (1995). Algebraic spans (preliminary version). In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pages 90--99, Ottawa, Ontario, Canada.

[Herlihy and Rajsbaum, 1999]
Herlihy, M. and Rajsbaum, S. (1999). New perspectives in distributed computing. In Kutylowski, M., Pacholski, L., and Wierzbicki, T., editors, 24th International Symposium on Mathematical Foundations of Computer Science, volume LNCS 1672, pages 170--186. Springer-Verlag.

[Herlihy and Shavit, 1993]
Herlihy, M. and Shavit, N. (1993). The asynchronous computability theorem for t-resilient tasks. In Proc. of the 25th STOC. ACM Press.

[Herlihy and Shavit, 1994]
Herlihy, M. and Shavit, N. (1994). A simple constructive computability theorem for wait-free computation. In Proceedings of STOC'94. ACM Press.

[Jayanti, 1993]
Jayanti, P. (1993). On the robustness of Herlihy's hierarchy. In Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, pages 145--157, Ithaca, New York, USA.

[Jayanti, 1997]
Jayanti, P. (1997). Robust wait-free hierarchies. Journal of the ACM, 44(4):592--614.

[Kahn, 1974]
Kahn, G. (1974). The semantics of a simple language for parallel programming. Information Processing, (74).

[Kahn and MacQueen, 1977]
Kahn, G. and MacQueen, D. B. (1977). Coroutines and networks of parallel processes. Information Processing, (77).

[Kobayashi, 1990]
Kobayashi, Y. (1990). Complete rewriting systems and homology of monoid algebras. Journal of Pure and Applied Algebra, 65:263--275.

[Lafont and Prouté, 1990]
Lafont, Y. and Prouté, A. (1990). Church-Rosser property and homology of monoids. Technical report, Ecole Normale Supérieure.

[Lanzmann, 1993]
Lanzmann, E. (1993). Automates d'ordre supérieur. Master's thesis, Université d'Orsay.

[Lévy, 1978]
Lévy, J.-J. (1978). Réductions Correctes et Optimales dans le Lambda-Calcul. PhD thesis, Université Paris VII.

[Lipski and Papadimitriou, 1981]
Lipski and Papadimitriou (1981). A fast algorithm for testing for safety and detecting deadlocks in locked transaction. ALGORITHMS: Journal of Algorithms.

[Lynch, 1996]
Lynch, N. (1996). Distributed Algorithms. Morgan-Kaufmann.

[Mac Lane, 1963]
Mac Lane, S. (1963). Homology. In Die Grundlehren der Mathematischen Wissenschaften in Einzeldarstellungen, volume 114. Springer Verlag.

[Mazurkiewicz, 1986]
Mazurkiewicz, A. (1986). Trace theory. In Rozenberg, G., editor, Petri Nets: Applications and Relationship to Other Models of Concurrency, Advances in Petri Nets 1986, PART II, PO of an Advanced Course, volume 255 of LNCS, pages 279--324, Bad Honnefs. Springer-Verlag.

[Papadimitriou, 1979]
Papadimitriou, C. H. (1979). The serializability of concurrent database updates. Journal of the ACM, 26(4):631--653.

[Papadimitriou, 1983]
Papadimitriou, C. H. (1983). Concurrency control by locking. SIAM Journal on Computing, 12(2):215--226.

[Penrose, 1972]
Penrose, R. (1972). Techniques of Differential Topology in Relativity, volume 7 of Conference Board of the Mathematical Sciences, Regional Conference Series in Applied Ma thematics. SIAM, Philadelphia, USA.

[Pratt, 1991]
Pratt, V. (1991). Modeling concurrency with geometry. In Proc. of the 18th ACM Symposium on Principles of Programming Languages. ACM Press.

[Pratt, 1999]
Pratt, V. (1999). Chu spaces. In Course notes for the School in Category Theory and Applications. Coimbra, Portugal.

[Preparata and Shamos, 1993]
Preparata, F. P. and Shamos, M. I. (1993). Computational Geometry, an Introduction. Springer-Verlag.

[Saks and Zaharoglou, 1993]
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.

[Sassone and Cattani, 1996]
Sassone, V. and Cattani, G. L. (1996). Higher-dimensional transition systems. In Proceedings of LICS'96.

[Sassone et al., 1994]
Sassone, V., Nielsen, M., and Winskel, G. (1994). Relationships between models of concurrency. In Proceedings of the Rex'93 school and symposium.

[Schenk, 1997]
Schenk, E. (1997). The consensus hierarchy is not robust. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, page 279, Santa Barbara, California.

[Shields, 1985]
Shields, M. (1985). Concurrent machines. Computer Journal, 28.

[Shoshani and Coffman, 1970]
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, pages 225--235, Santa Monica, California. IEEE.

[Soisalon-Soininen and Wood, 1985]
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), pages 108--116.

[Sokolowski, 1998a]
Sokolowski, S. (1998a). Homotopy in concurrent processes. Technical report, Institute of Computer Science, Gdansk Division.

[Sokolowski, 1998b]
Sokolowski, S. (1998b). Investigation of concurrent processes by means of homotopy functors. Technical report, Institute of Computer Science, Gdansk Division.

[Sokolowski, 1998c]
Sokolowski, S. (1998c). Point glueing in cpo-s. Technical report, Institute of Computer Science, Gdansk Division.

[Squier et al., 1994]
Squier, C. C., Otto, F., and Kobayashi, Y. (1994). A finiteness condition for rewriting systems. Theoretical Computer Science, 131:271--294.

[Stark, 1989]
Stark, A. (1989). Concurrent transition systems. Theoretical Computer Science, 64:221--269.

[Takayama, 1995]
Takayama, Y. (1995). Cycle filling as parallelization with expansion law. In submitted to publication.

[Takayama, 1996]
Takayama, Y. (1996). Extraction of concurrent processes from higher-dimensional automata. In Proceedings of CAAP'96, pages 72--85.

[Valmari, 1990]
Valmari, A. (1990). A stubborn attack on state explosion. In Proc. of CAV'90. Springer Verlag, LNCS.

[van Glabbeek, 1991]
van Glabbeek, R. (1991). Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, Manuscript available on the web as

[van Glabbeek and Goltz, 1989]
van Glabbeek, R. and Goltz, U. (1989). Partial order semantics for refinement of actions. Bulletin of the EATCS, (34).

[Winskel and Nielsen, 1994]
Winskel, G. and Nielsen, M. (1994). Models for concurrency, volume 3 of Handbook of Logic in Computer Science. Oxford University Press.

[Yannakakis et al., 1979]
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, pages 286--297, San Juan, Puerto Rico. IEEE.

Previous Contents