A concurrent system is defined as a monoid action of a trace monoid on a finite set of states. Concurrent systems represent state models where the state is distributed and where
state changes are local. Starting from a spectral property on the combinatorics of concurrent systems, we prove the existence and uniqueness of a Markov measure on the space of infinite trajectories relatively to any weight distributions. In turn, we obtain a combinatorial result by proving that the kernel of the associated Möbius matrix has dimension 1; the Möbius matrix extends in this context the Möbius polynomial of a trace monoid. We study ergodic properties of irreducible concurrent systems and we prove a Strong law of large numbers. It allows us to introduce the speedup as a measurement of the average amount of concurrency within infinite trajectories. Examples are studied.