The Community for Technology Leaders
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)
Melbourne, Victoria, Australia
Dec. 2, 1991 to Dec. 5, 1991
ISBN: 0-8186-2285-7
pp: 322-331
J. Campos , Centro Politecnio Superior Zaragoza Univ., Spain
B. Sanchez , Centro Politecnio Superior Zaragoza Univ., Spain
M. Silva , Centro Politecnio Superior Zaragoza Univ., Spain
ABSTRACT
Addresses the computation of lower bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. The authors try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering some pessimistic transformation rules operating locally on the net structure, its initial marking, and stochastic interpretation. Special interest have the obtained results for the case of live and bounded free choice nets and live marked graphs systems.<>
INDEX TERMS
Markov processes, Petri nets, queueing theory
CITATION

J. Campos, B. Sanchez and M. Silva, "Throughput lower bounds for Markovian Petri nets: transformation techniques," Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM), Melbourne, Victoria, Australia, , pp. 322-331.
doi:10.1109/PNPM.1991.238788
94 ms
(Ver 3.3 (11022016))