Funktionale Analyse von Queueing-Petri-Netzen durch Reduktion der Netzstruktur

Petri nets are a popular model for modelling synchronisation and concurrent systems.These nets are often analysed by state space exploration. Unfortunatly, for bigger nets the so-called problem of state explosion arises. One approach to cope with the problem is to reduce the net before state space exploration. In this thesis, common reduction rules are regarded and adapted for queueing petri nets. After that the rules are implemented into the open-source tool QPME and their practical effect for the qualitative analysis of queueing petri nets is examined on a few examples.