A Simple Petri Net Controller by Solving Some Integer Linear Programming Problems

Abstract

The number of control places for designing a simple Petri Net controller is important. So, many efforts have been accomplished during last decade to design a controller with small number of such places. But, the number after applying some of these methods is still large and some of the other methods are complicated. In this paper, we have attempted to develop the previous methods for obtaining a simple controller in a systematic way. In this method, a small number of control places are obtained by solving a few numbers of Integer Linear Programming Problems at which the numbers of constraints and variables in each problem smoothly grow with respect to the numbers of reachable states. Also, the controlled model is maximally permissive.