Efficient synthesis of control logic for a class of discrete event systems

Lawrence E. Holloway, Bruce H. Krogh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


A computationally efficient solution for a class of forbidden state problems is developed. The authors consider discrete-event systems (DESs) which can be modeled as cyclic controlled marked graphs (CMGs), a 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. They 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 that 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.

Original languageEnglish
Title of host publicationProceedings of 1989 American Control Conference
Number of pages6
StatePublished - 1989
EventProceedings of the 1989 American Control Conference - Pittsburgh, PA, USA
Duration: Jun 21 1989Jun 23 1989


ConferenceProceedings of the 1989 American Control Conference
CityPittsburgh, PA, USA

ASJC Scopus subject areas

  • Engineering (all)


Dive into the research topics of 'Efficient synthesis of control logic for a class of discrete event systems'. Together they form a unique fingerprint.

Cite this