Weighted asynchronous cellular automata

We study weighted systems whose behavior is described as a formal power series over a free partially commutative or trace monoid. It is shown that the interleaving approach and the distributed approach are equivalent in this setting. This holds, both in the deterministic and in the nondeterministic case. Consequently, we obtain a particularly simple class of sequential weighted automata that already have full expressive power.