In: International Journal of Intelligent Control Systems, Vol. 3, No. 3, pages 343-358. 1999.
Abstract: The paper presents an algorithm of polynomial complexity to derive the throughput is a discrete event system via stochastic Petri net (SPN) modes. The concept of flow nets, a subclass of SPNs, is introduced to model a class of discrete event systems. The mathematical model for the throughput of flow nets is given and analysis can be performed through linear programming. The linear programming problem size can be significantly reduced for a class of structurally non-competitive and acyclic flow nets. A procedure is proposed to convert a structurally competitive and cyclic flow net to a structurally non-competitive and acyclic one in the sense of equivalence throughput. A discrete manufacturing system is used to illustrate the application of the proposed concepts and algorithms for its throughput analysis.
Keywords: discrete-event systems, stochastic Petri nets, throughput analysis.
Back to the Petri Nets Bibliography