Task resource models and max-plus automata

Stéphane Gaubert (1) , Jean Mairesse (2)

1 META2 - Mathematical and Computer Science Tools for Automatic Control
2 MISTRAL - Modeling of Computer Systems and Telecommunication Networks : Research and Software Development

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.

Mots clés: max-plus semiring; Trace monoid; automaton with multiplicities; max-plus semiring.

Domaines: Mathématique discrète [cs.DM]

Stéphane Gaubert, Jean Mairesse. Task resource models and max-plus automata. Idempotency, Cambridge University Press, pp.133-144, 1998, Publications of the Newton Institute. ⟨hal-00165914⟩