DocumentCode
1527582
Title
Decomposition of the supervisory control problem for Petri nets under preservation of maximal permissiveness
Author
Stremersch, G. ; Boel, R.K.
Author_Institution
Syst. Res. Group, Ghent Univ., Belgium
Volume
46
Issue
9
fYear
2001
fDate
9/1/2001 12:00:00 AM
Firstpage
1490
Lastpage
1496
Abstract
Decomposing the design of supervisory control laws for Petri nets is an efficient way to tackle its complexity. We consider legal sets which are the union of two sets. In general, this can make the control law obtained via decomposition too restrictive, i.e., it disables more transitions than necessary. Generalizing existing results, we give structural conditions under which the control law via decomposition is maximally permissive
Keywords
Petri nets; control system synthesis; discrete event systems; state-space methods; Petri nets; decomposition; discrete event systems; permissiveness; state space; supervisory control; Computational complexity; Control systems; Discrete event systems; Feedback control; Law; Legal factors; Petri nets; Safety; Size control; Supervisory control;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.948484
Filename
948484
Link To Document