Abstract
Higher dimensional automata can model concurrent computations. The topological structure of the higher dimensional automata determines certain properties of the concurrent computation. We introduce bicomplexes as an algebraic tool for describing these automata and develop a simple homology theory for higher dimensional automata. We then show how the homology of automata has applications in the study of branching-time equivalences of processes such as bisimulation.
This work was partially supported by ESPRIT BRA 3074 SEMAGRAPH
Preview
Unable to display preview. Download preview PDF.
References
Rob van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, 1991.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
Yves Lafont and Alain Prouté. Church-Rosser property and homology of monoids. Technical report, Ecole Normale Supérieure, 1990.
Serge Lang. Algebra. Addison Wesley, second edition, 1984.
Saunders Mac Lane. Categories for the working mathematician. Springer-Verlag, 1971.
William S. Massey. Homology and cohomology theory. In Monographs and Textbooks in Pure and Applied Mathematics, number 46. Marcel DEKKER, INC., 1978.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
Henri Poincaré. De analysis situ. Journal de l'Ecole Polytechnique, 1895.
Vaughan Pratt. Modeling concurrency with geometry. In Proc. 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goubault, E., Jensen, T.P. (1992). Homology of higher dimensional automata. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0084796
Download citation
DOI: https://doi.org/10.1007/BFb0084796
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55822-4
Online ISBN: 978-3-540-47293-3
eBook Packages: Springer Book Archive