Abstract
AbstractGiven 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.
Funder
Fundação para a Ciência e a Tecnologia
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Geometry and Topology
Reference18 articles.
1. Bourbaki, N.: Algebra I. Addison-Wesley (1974)
2. Brown, R., Higgins, P.J.: On the algebra of cubes. J. Pure Appl. Algebra 21(3), 233–260 (1981)
3. Fahrenberg, U.: Higher-dimensional automata from a topological viewpoint, Ph.D. thesis, Aalborg University, Denmark, (2005)
4. Fiedorowicz, Z., Loday, J.-L.: Crossed simplicial groups and their associated homology. Trans. Am. Math. Soc. 326(1), 57–87 (1991)
5. Gaucher, P.: Combinatorics of labelling in higher-dimensional automata. Theor. Comput. Sci. 411, 1452–1483 (2010)