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.
|Number of pages||13|
|Journal||IEEE Transactions on Automatic Control|
|State||Published - 1996|
Bibliographical noteFunding 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