Algebraic tools for the performance evaluation of discrete event systems

It is shown that a certain class of Petri nets called event graphs can be represented as linear time-invariant finite-dimensional systems using some particular algebras. This sets the ground on which a theory of these systems can be developed in a manner which is very analogous to that of conventional linear system theory. Some preliminary basic developments in that direction are shown. Several ways in which one can consider event graphs as linear systems are described. These correspond to approaches in the time domain, in the event domain, and in a two-dimensional domain. In each of these approaches, a different algebra has to be used for models to remain linear, but the common feature of these algebras is that they all fall into the axiomatic definition of `dioids´. A unified presentation of basic algebraic results on dioids is provided