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.

The preliminaries section is taken from arXiv:1303.2003v1

References in corpus (3)

• Homological properties of non-deterministic branchings and mergings in higher dimensional automata
• Homology and Bisimulation of Asynchronous Transition Systems and Petri Nets
• Weak morphisms of higher dimensional automata