Homology of higher dimensional automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCONCUR 1992 - 3rd International Conference on Concurrency Theory, Proceedings
EditorsW. Rance Cleaveland
PublisherSpringer Verlag
Pages254-268
Number of pages15
ISBN (Print)9783540558224
DOIs
Publication statusPublished - 1 Jan 1992
Event3rd International Conference on Concurrency Theory, CONCUR 1992 - Stony Brook, United States
Duration: 24 Aug 199227 Aug 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume630 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Concurrency Theory, CONCUR 1992
Country/TerritoryUnited States
CityStony Brook
Period24/08/9227/08/92

Fingerprint

Dive into the research topics of 'Homology of higher dimensional automata'. Together they form a unique fingerprint.

Cite this