Stochastic Petri Nets sensitivity to token scheduling policies

Stochastic Petri Nets and their generalizations are powerful formalisms for the specification of stochastic processes. In their original definition they do not provide any specification for the token extraction order applied by a transition to its input places, however this aspect may be relevant if timed transitions are interpreted as servers and tokens as customers, so that the extraction order may be interpreted as a scheduling policy. In this paper we discuss how the token scheduling policies different from the Random Order one which is assumed by default, may be relevant for the computation of average performance indices.