On the homology language of HDA models of transition systems (Q6645910)

Higher-Dimensional Automata (HDA) are combinatorial-topological models used to represent concurrent systems. The homological language is a homological tool used to describe the global independence structure of an HDA. The independence relation is a relation on the alphabet of labels that indicates which transitions can occur independently of each other. The paper shows that by choosing an acyclic relation whose symmetric closure is the given independence relation, one can construct a much smaller nonsymmetric HDA with the same homology language.