In: 92: Hildesheimer Informatik-Berichte 7. 1992.
Abstract: In this paper we obtain some monotonicity results for some classes of Stochastic Petri Nets (SPN), a model closely related to queueing networks. in Stochastic Petri nets a random variable (r.v.) is associated to each transition, which models its processing time. First, we extend the results for Marked Graphs: we consider a more general firing semantics (infinite server semantics), present monotonicity with respect to the service time of transitions instead of with respect of holding time, and remove the restrictions usually given on the distributions of the firing time of the transitions. Then we extend the obtained results to the class of safe Free Choice nets.