An efficient algorithm for finding structural deadlocks in colored petri nets

Abstract

In this paper, we present an algorithm to compute structural deadlocks in colored nets under specified conditions. Instead of applying the ordinary algorithm on the unfolded Petri net, our algorithm takes advantage of the structure of the color functions. It is obtained by iterative optimizations of the ordinary algorithm. Each optimization is specified by a meta-rule, whose application is detected during the computation of the algorithm. The application of such meta-rules speeds up a step of the algorithm with a factor proportional to the size of a color domain. We illustrate the efficiency of this algorithm compared to the classical approach on a colored net modelling the dining philosophers problem.