A generalization of state avoidance policies for controlled Petri nets

Lawrence E. Holloway; Xiaoyi Guan; Lan Zhang

doi:10.1109/9.506233

A generalization of state avoidance policies for controlled Petri nets

Lawrence E. Holloway, Xiaoyi Guan, Lan Zhang

Institute for Sustainable Manufacturing (ISM)

Research output: Contribution to journal › Article › peer-review

78 Scopus citations

Abstract

This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law.

Original language	English
Pages (from-to)	804-816
Number of pages	13
Journal	IEEE Transactions on Automatic Control
Volume	41
Issue number	6
DOIs	https://doi.org/10.1109/9.506233
State	Published - 1996

Bibliographical note

Funding Information:
Manuscript received January 6, 1995; revised December 22, 1995. Recommended by Associate Editor, W.-B. Gong. This work was supported in part by the NSF under Grant ECS-9308737, Rockwell International, NASA under Grant NGT-40049, and the Center for Robotics and Manufacturing Systems at the University of Kentucky.

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/9.506233

Cite this

@article{2ba5845023114cc684a377c0d84c06db,

title = "A generalization of state avoidance policies for controlled Petri nets",

abstract = "This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law.",

author = "Holloway, {Lawrence E.} and Xiaoyi Guan and Lan Zhang",

note = "Funding Information: Manuscript received January 6, 1995; revised December 22, 1995. Recommended by Associate Editor, W.-B. Gong. This work was supported in part by the NSF under Grant ECS-9308737, Rockwell International, NASA under Grant NGT-40049, and the Center for Robotics and Manufacturing Systems at the University of Kentucky.",

year = "1996",

doi = "10.1109/9.506233",

language = "English",

volume = "41",

pages = "804--816",

number = "6",

}

TY - JOUR

T1 - A generalization of state avoidance policies for controlled Petri nets

AU - Holloway, Lawrence E.

AU - Guan, Xiaoyi

AU - Zhang, Lan

N1 - Funding Information: Manuscript received January 6, 1995; revised December 22, 1995. Recommended by Associate Editor, W.-B. Gong. This work was supported in part by the NSF under Grant ECS-9308737, Rockwell International, NASA under Grant NGT-40049, and the Center for Robotics and Manufacturing Systems at the University of Kentucky.

PY - 1996

Y1 - 1996

N2 - This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law.

AB - This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law.

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

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

U2 - 10.1109/9.506233

DO - 10.1109/9.506233

M3 - Article

AN - SCOPUS:0030164453

SN - 0018-9286

VL - 41

SP - 804

EP - 816

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 6

ER -

A generalization of state avoidance policies for controlled Petri nets

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this