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 efficiently determining the maximally permissive controls for the marking.
Original language | English |
---|---|
Pages (from-to) | 204-250 |
Number of pages | 47 |
Journal | Proceedings of the IEEE Conference on Decision and Control |
Volume | 1 |
DOIs | |
State | Published - 1993 |
Event | Proceedings of the 32nd Conference on Decision and Control - San Antonio, TX, USA Duration: Dec 15 1993 → Dec 15 1993 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization