The homology graph of a higher dimensional automaton
Algebraic Topology
2013-07-31 v1 Formal Languages and Automata Theory
Abstract
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is invariant under homeomorphic abstraction, i.e. under weak morphisms that are homeomorphisms.
Keywords
Cite
@article{arxiv.1307.7994,
title = {The homology graph of a higher dimensional automaton},
author = {Thomas Kahl},
journal= {arXiv preprint arXiv:1307.7994},
year = {2013}
}
Comments
The preliminaries section is taken from arXiv:1303.2003v1