Topology for Computations of Concurrent Automata
We generalize the results on α-complex traces from [14, 16] to the realm of concurrent automata. We show that the α-complex computations can be defined as elements of a compact, totally disconnected and complete topological semigroup containing the finite computations as a dense and discrete subspace. But in this semigroup it is not possible to define infinite products as limits of finite ones in a satisfactory way. Therefore, we define a second semigroup of restricted α-complex computations. The underlying set of this semigroup carries a metric such that it becomes compact and complete. Furthermore, the finite computations are a dense and discrete subset and the multiplication is uniformly continuous not on the whole semigroup but on the set of finite computations. Finally, here we can define infinite products as limits of finite ones.