On the homology language of HDA models of transition systems
Formal Languages and Automata Theory
2022-08-05 v1 Algebraic Topology
Abstract
Given a transition system with an independence relation on the alphabet of labels, one can associate with it a usually very large symmetric higher-dimensional automaton. The purpose of this paper is to show that by choosing an acyclic relation whose symmetric closure is the given independence relation, it is possible to construct a much smaller nonsymmetric HDA with the same homology language.
Keywords
Cite
@article{arxiv.2208.02286,
title = {On the homology language of HDA models of transition systems},
author = {Thomas Kahl},
journal= {arXiv preprint arXiv:2208.02286},
year = {2022}
}
Comments
17 pages