Skip to main content
SpringerLink
Log in

Homology of higher dimensional automata

  • Conference paper
  • First Online:
CONCUR '92 (CONCUR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 630))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Ecole Normale Supérieure, LIENS, 45 rue d'Ulm, 75230, Paris Cedex 05, France

    Eric Goubault

  2. Dept. of Computing, Imperial College, 180 Queen's Gate, SW7 2BZ, London, UK

    Thomas P. Jensen

Authors
  1. Eric Goubault
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas P. Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W.R. Cleaveland

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation