In: IEEE Trans. Software Eng., Vol. 17, No. 2, pages 117-125. February 1991.
Abstract: Ergodicity and throughput bound characterizations are addressed for a subclass of timed and stochastic Petri nets, interleaving qualitative and quantitative theories. The nets considered represent an extension of the well-known subclass of marked graphs, defined as having a unique consistent firing count vector, independently of the stochastic interpretation of the net model. Upper and lower throughput bounds are computed using linear programming problems defined on the incidence matrix of the underlying net. From a different perspective, the considered subclasses of stochastic nets can be viewed as special classes of synchronized queuing networks.
Keywords: ergodicity (and) throughput bounds (of nets); timed stochastic net; interleaving (theories); linear programming; incidence matrix; synchronized queueing network.