For the most recent entries see the Petri Nets Newsletter.

Tight Polynomial Bounds for Steady-State Performance of Marked Graphs.

Campos, J.; Chiola, G.; Colom, J.M.; Silva, M.

Universidad de Zaragoza, departamento de ingenieria electrica e informatica, Research Report 89-07, May 1989.

Also in: PNPM89. Proceedings of the Third International Workshop On Petri Nets and Performance Models, 1989, Kyoto, Japan, pages 200-209. 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 Marked Graphs is studied. In particular, Linear Programming problems defined on the incidence matrix of the underlying Petri nets are used to compute tight (i.e. reachable) bounds for the throughput of transitions for live and bounded Marked Graphs with time associated with transitions. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.

Keywords: steady-state performance; timed (and) stochastic marked graph; linear programming.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography