Performance evaluation of timed automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Performance evaluation of timed automata


We introduce automata over the (max, +) algebra : this formalism encompasses in particular (max, +) linear systems and a subclass of stochastic timed event graphs. Performance evaluation is considered in the worst,mean, and optical cases. A simple algebraic reduction is provided for the worst case. The later cases are reduced to projective finiteness properties of semigroups of matrices. The mean performance is given by the Kolmogorov equation of a Markov chain in the projective space. The optimal performance is given by an analogous Hamilton-Jacobi-Bellman equation.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1922.pdf (395.44 Ko) Télécharger le fichier

Dates and versions

inria-00074752 , version 1 (24-05-2006)


  • HAL Id : inria-00074752 , version 1


Stéphane Gaubert. Performance evaluation of timed automata. [Research Report] RR-1922, INRIA. 1993. ⟨inria-00074752⟩
83 View
89 Download


Gmail Facebook Twitter LinkedIn More