In: PNPM89. Proceedings of the Third International Workshop On Petri Nets and Performance Models, 1989, Kyoto, Japan, pages 210-220. Los Alamitos, CA, USA: IEEE Computer Society Press, 1990.
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. These classes of nets are defined and their characteristics are studied. The bounds proposed depend on the initial marking and the mean values of the delays but not on the probability distributions; moreover they can be computed also for non-ergodic models.
Keywords: steady-state performance; timed (and) stochastic net; linear programming.