Homology of higher dimensional automata
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.
KeywordsTensor Product Homology Group Finite Automaton Algebraic Topology Process Algebra
Unable to display preview. Download preview PDF.
- 1.Rob van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, 1991.Google Scholar
- 2.J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.Google Scholar
- 3.Yves Lafont and Alain Prouté. Church-Rosser property and homology of monoids. Technical report, Ecole Normale Supérieure, 1990.Google Scholar
- 4.Serge Lang. Algebra. Addison Wesley, second edition, 1984.Google Scholar
- 5.Saunders Mac Lane. Categories for the working mathematician. Springer-Verlag, 1971.Google Scholar
- 6.William S. Massey. Homology and cohomology theory. In Monographs and Textbooks in Pure and Applied Mathematics, number 46. Marcel DEKKER, INC., 1978.Google Scholar
- 7.Robin Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
- 8.Henri Poincaré. De analysis situ. Journal de l'Ecole Polytechnique, 1895.Google Scholar
- 9.Vaughan Pratt. Modeling concurrency with geometry. In Proc. 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.Google Scholar