@INPROCEEDINGS{gaubert93d, author={S. Gaubert}, title={Symbolic computation of periodic throughputs of timed event graphs}, booktitle={Proceedings of the Belgian-French-Netherlands Summer School on Discrete Event systems}, year={1993}, month={June}, address={Spa}, }
We show that periodic throughputs of Timed Event Graphs with symbolic markings can be computed by Gaussian elimination algorithms performed in some dioid algebra of finite subsets of $R^n$. Some related results about resource optimization are discussed.