Decomposition of the supervisory control problem for Petri nets under preservation of maximal permissiveness

DOI10.1109/9.948484MaRDI QIDQ4540501zbMATH OpenOpenAlexFDO

Authors G. Stremersch, R. K. Boel

Publication date 21 July 2002

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.948484

zbMATH Keywords

Petri netssupervisory controlmaximal permissiveness

Mathematics Subject Classification ID

Hierarchical systems (93A13) Decentralized systems (93A14) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Reduction of the supervisory control problem for Petri nets
• A branch and bound approach for the design of decentralized supervisors in Petri net models
• Synthesis of decentralized supervisor for Petri nets using decomposition with overlapping places
• Centralized and decentralized supervisory controller design to enforce boundedness, liveness, and reversibility in Petri nets
• Blocking and controllability of Petri nets in supervisory control

Cited in

(5)

• Decidability and closure properties of weak Petri net languages in supervisory control
• A branch and bound approach for the design of decentralized supervisors in Petri net models
• Synthesis of decentralized supervisor for Petri nets using decomposition with overlapping places
• Reduction of the supervisory control problem for Petri nets
• Supervision based on place invariants: a survey

This page was built for publication: Decomposition of the supervisory control problem for Petri nets under preservation of maximal permissiveness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540501)