Universidad de Zaragoza, departamento de ingenieria electrica e informatica, Research Report 89-08, May 1989.
Abstract: The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Petri Nets is studied. In particular, Linear Programming Problems defined on the incidence matrix of the underlying Petri net are used to compute bounds for the throughput of transitions for live and bounded nets with a unique possibility of steady-state behaviour.