@INCOLLECTION{gaumair95, author={S. Gaubert and J. Mairesse}, title={Task resource systems and (max,+) Automata}, booktitle={Idempotency}, editor={J. Gunawardena}, series={Publications of the Newton Institute}, publisher={Cambridge University Press}, note={(to appear in 1996)}, year={1995}, month={Aug.}, }

We show that a typical class of timed concurrent systems can be modeled as automata with multiplicities in the (max,+) semiring. This representation can be seen as a timed extension of the logical modeling in terms of trace monoids. We briefly discuss the applications of this algebraic modeling to performance evaluation.