Extraction of concurrent processes from higher dimensional automata

  • Yukihide Takayama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1059)


We present an algorithm, called reverse interpretation, that extracts concurrent processes from labeled cubical complexes. E. Goubault and T. Jensen


process algebra higher dimensional automata geometric topology 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Goubault. Domains of Higher-Dimensional Automata. In CONCUR'93, LNCS 715. Springer-Verlag, 1993.Google Scholar
  2. [2]
    E. Goubault and T. P. Jensen. Homology of Higher Dimensional Automata. In CONCUR'92, LNCS 630. Springer-Verlag, 1992.Google Scholar
  3. [3]
    J. Gunawardena. Homotopy and Concurrency. In Bulletin of the EATCS, Number 54. EATCS, 1994.Google Scholar
  4. [4]
    M. Herlihy. A tutorial on algebraic topology and distributed computation, 1994. Draft available herlihy@crl.dec.com.Google Scholar
  5. [5]
    V. Pratt. Modeling Concurrency with Geometry. In 18th Annual ACM Symposium on Principles of Programming Languages. ACM, 1991.Google Scholar
  6. [6]
    Y. Takayama. Cycle Filling as Parallelization with Expansion Law, 1995. submitted.Google Scholar
  7. [7]
    Yves Lafont and Alain Prouté. Church-Rosser property and homology of monoids. Mathematical Structure in Computer Science, 1, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yukihide Takayama
    • 1
  1. 1.Department of Computer ScienceRitsumeikan UniversityShigaJapan

Personalised recommendations