Synthesis of feedback control logic for a class of controlled Petri nets

Abstract

An efficient solution is developed for a class of forbidden state problems for discrete event systems (DESs). DESs are considered which can be modeled as cyclic controlled marked graphs (CMGs), a special class of controlled Petri nets (CPNs). The distributed representation of the DES state in terms of the CMG marking permits an efficient specification of the forbidden states in terms of individual place markings. More important, it is shown that the graphical representations of the state transition logic in a CMG can be used to synthesize state feedback logic which is maximally permissive while guaranteeing the forbidden states will not occur. The practical application of the theoretical results is illustrated for an example of automated guided vehicle (AGV) coordination in a flexible manufacturing facility.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>