ON AUTOMATION OF SOME PETRINET ANALYSIS TECHNIQUES

Abstract

Petrinets (PN) have aroused considerable interest during the recent years as a modelling technique, primarily to represent and study concurrent systems. However modelling by itself is of little use. It is also necessary to analyse the modeled system. For this reason,. the reachability tree and matrix analysis techniques were developed. These techniques offer an inherent advantage that they allow automatic ana-lysis of modelled systems as they can be easily implemented on a computer. This thesis deals precisely with implementa-tion of these techniques. First, program has been developed to generate the reachability tree for a Petrinet, from the given input Incidence matrix, output incidence matrix and initial marking. Further this tree is used to validate the model for certain properties like safeness, boundedness, cons€ovation and coverability. Even a Petrinet with a finite reachability set can theoretically, result in an infinite tree but in the implemented version of this technique provision has been made to limit the size of the tree using w-factor. Secondly the Matrix Analysis Technique for Petrinets has also been implemented in this thesis. The program that has been developed for this technique takes initial marking and firing vector as input and generates the final marking.