An Alternative View of Fairness in Petri Nets
Martin Ibl · 2008
In modelling and analysis of concurrent systems is usually placed the main emphasis on their accuracy and validity, i.e. the model meets the formal specification and also modelled the relevant facts. Moreover, in recent years in various fields, the importance of the concept of fairness starts to develop, which covers such requirements on system/model, such as uniformity of resource usage, fair queuing policy, the problem of starvation and many others. The aim of this work is to define a method of calculating the uniformity of the distribution of specific system states that can be used to investigate the uniformity of the workload of individual entities / elements of the system. The method is based on modelling by classical Place/Transition Petri nets and measuring the entropy of subsets of specific markings in the reachability graph of the Petri net. The presented method is an alternative view on the fairness of the already defined fairness which in the theory of Petri nets deals with transitions.