System analysis is often needed with respect to both qualitativeand quantitative aspects. In recent decades, several formalisms havebeen developed that attempt to combine these aspects in one description.Present emphasis is on stochastic Petri nets. One disadvantage of theseformalisms is the difficulties when describing scheduling strategieswith Petri net elements. A new version of queuing Petri nets (QPNs),which combines queuing networks and Petri nets, aiming at eliminatingthese disadvantages is described. The new version also exhibits themodeling of timed transitions and timeless queues for describing purescheduling 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 theorycan be exploited for analysis of QPNs, thus supporting the generalobjective of combining Petri net and queueing network formalisms
展开▼
