Real-world applications of the emerging theory of controlled discrete event systems (DES's) will not be realized until thi obstacle of computational complexity is overcome. This paper present1 a step in that direction by developing an efficient solution for a class o forbidden state problems. We consider DES's which can be modeled as cyclic controlled marked graphs (CMG's), a special class of controllet Petri nets (CPN's). The distributed representation of the DES state ir terms of the CMG marking permits an efficient specification of the forbidden states in terms of individual place markings. More importantly, we show that the graphical representation 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 nol occur. The practical application of the theoretical results is illustrated for an example of automated guided vehicle (AGV) coordination in a flexible manufacturing facility.
|Number of pages||10|
|Journal||IEEE Transactions on Automatic Control|
|State||Published - May 1990|
Copyright 2015 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering