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

Lawrence E. Holloway; Bruce H. Krogh

doi:10.23919/acc.1989.4790641

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 proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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 language	English
Title of host publication	Proceedings of 1989 American Control Conference
Pages	2672-2677
Number of pages	6
DOIs	https://doi.org/10.23919/acc.1989.4790641
State	Published - 1989
Event	Proceedings of the 1989 American Control Conference - Pittsburgh, PA, USA Duration: Jun 21 1989 → Jun 23 1989

Conference

Conference	Proceedings of the 1989 American Control Conference
City	Pittsburgh, PA, USA
Period	6/21/89 → 6/23/89

ASJC Scopus subject areas

General Engineering

Access to Document

10.23919/acc.1989.4790641

Cite this

@inproceedings{1e89708bc636433782d11b5a0bca1b1a,

title = "Efficient synthesis of control logic for a class of discrete event systems",

abstract = "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.",

author = "Holloway, {Lawrence E.} and Krogh, {Bruce H.}",

year = "1989",

doi = "10.23919/acc.1989.4790641",

language = "English",

pages = "2672--2677",

booktitle = "Proceedings of 1989 American Control Conference",

note = "Proceedings of the 1989 American Control Conference ; Conference date: 21-06-1989 Through 23-06-1989",

}

TY - GEN

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

AU - Holloway, Lawrence E.

AU - Krogh, Bruce H.

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024889586&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024889586&partnerID=8YFLogxK

U2 - 10.23919/acc.1989.4790641

DO - 10.23919/acc.1989.4790641

M3 - Conference contribution

AN - SCOPUS:0024889586

SP - 2672

EP - 2677

BT - Proceedings of 1989 American Control Conference

T2 - Proceedings of the 1989 American Control Conference

Y2 - 21 June 1989 through 23 June 1989

ER -

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

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this