DocumentCode
1425951
Title
Reduction of the supervisory control problem for Petri nets
Author
Stremersch, G. ; Boel, R.K.
Author_Institution
SYSTeMS Res. Group, Ghent Univ., Belgium
Volume
45
Issue
12
fYear
2000
fDate
12/1/2000 12:00:00 AM
Firstpage
2358
Lastpage
2363
Abstract
The authors prove a reduction theorem for the supervisory control problem for general Petri nets with general legal sets. To design control laws guaranteeing that the marking stays within the legal set, it suffices to consider a sub-Petri net of the full model. This extends existing design algorithms, allows to prove an important property of maximally permissive control laws and limits the number of events which need to be observed
Keywords
Petri nets; control system synthesis; discrete event systems; DES; control law design; discrete event systems; legal sets; maximally permissive control laws; sub-Petri net; supervisory control problem reduction; Algorithm design and analysis; Automata; Automatic control; Discrete event systems; Law; Legal factors; Petri nets; Safety; State-space methods; Supervisory control;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.895574
Filename
895574
Link To Document