Thomas Kahl - Weak equivalence of higher-dimensional automata

dmtcs:5884 - Discrete Mathematics & Theoretical Computer Science, May 18, 2021, vol. 23 no. 1 -
Weak equivalence of higher-dimensional automata

Authors: Thomas Kahl

This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence structure of an HDA. It is shown that weak equivalence is compatible with both the tensor product and the coproduct of HDAs and that, under certain conditions, HDAs may be reduced to weakly equivalent smaller ones by merging and collapsing cubes.

Volume: vol. 23 no. 1
Section: Automata, Logic and Semantics
Published on: May 18, 2021
Accepted on: May 4, 2021
Submitted on: October 31, 2019
Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory,Mathematics - Algebraic Topology,68Q85, 55N99


Consultation statistics

This page has been seen 174 times.
This article's PDF has been downloaded 84 times.