Skip to Main Content
This paper deals with supervisory control of discrete event systems (DES) modeled by interpreted Petri nets (IPN). In the approach herein proposed, both, the specification and the system model are described by IPN, however, the specification describes a state subset that the specification must reach. It also captures the order in which these states must be reached. Based on this framework, this paper presents a method to compute the system firing transition sequence in order to confine the system model into the specification behavior. Although this problem is NP-complete, the proposed solution exploits the structural information of both IPN (system and specification) to compute Parikh vectors of system firing sequences; one vector per each transition of the specification. These Parikh vectors are processed in order to obtain controllable fireable transition sequences. Thus a divide and conquer technique is used, where the NP-complete problem divided into k small size problems (where k is the number of specification transitions), reducing the computational time of proposed algorithms. Moreover, the technique herein presented is suitable for distributed and hierarchical control. All algorithms herein purposed have being implemented in MAPLE.