arXiv · 1307.7994
The homology graph of a higher dimensional automaton
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.
Explore related subjects
Keep this discovery
Thomas Kahl. 2013-07-30. The homology graph of a higher dimensional automaton. https://arxiv.org/abs/1307.7994
Cite the original work for its findings. Save a collection to share your selection of sources.