In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 237-256. June 1991.
Abstract: This paper addresses the computation of upper bounds for the throughtput of transitions of live and safe deterministically or stochastically timed free choice nets. The obtained results are extensions of the marked graph case, presented by the auhors in previous works. Polynomial complexity algorithms are derived using linear programming techniques. The obtained values are tight in the sense that, with the only knowledge of the net topology, the mean service times of transitions, and the routing rates at conflicts, is not possible to improve the bounds.
Keywords: throughput upper bound (for) live (and) safe free choice net(s), deterministically (or) stochastically timed; polynomial complexity algorithm; linear programming; mean service time (of) transition(s); routing rate (at) conflict(s).
Back to the Petri Nets Bibliography