Informatik IV, Universität Dortmund, 44221 Dortmund, Germany
This article describes a new version of Queueing Petri Nets (QPNs), which combines Queueing Networks and Petri Nets, aiming at eliminating these disadvantages. The new version also exhibits the modeling of timed transitions and 'timeless' queues for describing pure scheduling mechanisms. QPNs are a superset of Queueing Networks and (Generalized Stochastic) Petri Nets. The analysis of QPNs is discussed and it is shown that efficient analysis techniques from Petri Net theory can be exploited for analysis of QPNs, thus supporting the general objective of combining Petri Net and Queueing Network formalisms.