Combinatorics on traces
Asynchronous mappings and asynchronous cellular automata
Information and Computation
The Kleene-Schützenberger theorem for formal power series in partially commuting variables
Information and Computation
The Book of Traces
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Weighted asynchronous cellular automata
Theoretical Computer Science
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |
We study weighted distributed systems whose behavior is described as a formal power series over a free partially commutative or trace monoid. We characterize the behavior of such systems both, in the deterministic and in the non-deterministic case. As a consequence, we obtain a particularly simple class of sequential weighted automata that have already the full expressive power.