Weak morphisms of higher dimensional automata

2013/03/08 by Thomas Kahl, Kahl, Thomas · 1 citation
Computer Science · Mathematics · #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:55U10 #msc:68Q45 #msc:68Q85

paper · pdf · doi:10.48550/arxiv.1303.2003

arxiv created 2013/03/08 · arxiv updated 2013/03/11

Abstract

We introduce weak morphisms of higher dimensional automata and use them to define preorder relations for HDAs, among which homeomorphic abstraction and trace equivalent abstraction. It is shown that homeomorphic abstraction is essentially always stronger than trace equivalent abstraction. We also define the trace language of an HDA and show that, for a large class of HDAs, it is invariant under trace equivalent abstraction.

Cited by

• The homology graph of a higher dimensional automaton

Related

• Topological abstraction of higher-dimensional automata
• The homology graph of a higher dimensional automaton
• Languages of Higher-Dimensional Automata
• Labeled homology of higher-dimensional automata
• Büchi-Elgot-Trakhtenbrot Theorem for Higher-Dimensional Automata