DocumentCode :
1079854
Title :
Petri net structural analysis for supervisory control
Author :
Giua, Alessandro ; DiCesare, Frank
Author_Institution :
Istituto di Elettrotecnica, Cagliari Univ., Italy
Volume :
10
Issue :
2
fYear :
1994
fDate :
4/1/1994 12:00:00 AM
Firstpage :
185
Lastpage :
195
Abstract :
The primary motivation for this research is to show how Petri nets may be efficiently used within the framework of supervisory control. In particular, the paper discusses how integer programming techniques for Petri net models may be used to validate supervisors for the control of discrete event systems. We consider a class of place/transition nets, called elementary composed state machines. The reachability problem for this class can be solved by a modification of classical incidence matrix analysis. In fact it is possible to derive a set of linear inequalities that exactly defines the set of reachable markings. Finally, we show how important properties of discrete event systems, such as the absence of blocking states or controllability, may be analyzed by integer programming techniques
Keywords :
Petri nets; automata theory; control system analysis; controllability; discrete time systems; integer programming; Petri net structural analysis; discrete event systems; elementary composed state machines; incidence matrix analysis; integer programming; linear inequalities; place/transition nets; reachable markings; supervisory control; Control system analysis; Control theory; Controllability; Discrete event systems; Explosions; Linear matrix inequalities; Linear programming; Petri nets; State-space methods; Supervisory control;
fLanguage :
English
Journal_Title :
Robotics and Automation, IEEE Transactions on
Publisher :
ieee
ISSN :
1042-296X
Type :
jour
DOI :
10.1109/70.282543
Filename :
282543
Link To Document :
بازگشت