The homology graph of a higher dimensional automaton

2013/07/30 by Thomas Kahl, Kahl, Thomas
Computer Science · Mathematics · #55N99 #55U10 #68Q45 #68Q85 #Algebraic Topology (math.AT) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #cs.FL #math.AT #msc:55N99 #msc:55U10 #msc:68Q45 #msc:68Q85

paper · pdf · doi:10.48550/arxiv.1307.7994

The preliminaries section is taken from arXiv:1303.2003v1

arxiv created 2013/07/30 · arxiv updated 2013/07/31

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.

Citations

• Weak morphisms of higher dimensional automata

Related

• Labeled homology of higher-dimensional automata
• On the topology of concurrent systems
• Topological abstraction of higher-dimensional automata
• About the globular homology of higher dimensional automata
• On the homology language of HDA models of transition systems