DocumentCode :
2571787
Title :
The controllability and supremal controllable sublanguage of Petri net languages
Author :
Keyi, Xing ; Baosheng, Hu ; Haoxun, Chen
Author_Institution :
Syst. Eng. Inst., Xi´´an Jiaotong Univ., China
fYear :
1994
fDate :
10-12 Oct 1994
Firstpage :
236
Lastpage :
241
Abstract :
In this paper we discuss the controllability problem of Petri net languages and obtain the necessary and sufficient condition for it. Then we present a method for synthesizing a feedback controller by which the closed loop system generates the supremal controllable sublanguage of a given Petri net language, and two examples are given for illustration
Keywords :
Petri nets; closed loop systems; controllability; discrete event systems; formal languages; Petri net languages; closed loop system; controllability; discrete event system; feedback controller; necessary condition; sufficient condition; supervisory control; supremal controllable sublanguage; Control system synthesis; Control systems; Controllability; Discrete event systems; Extremities; Labeling; Petri nets; Sufficient conditions; Supervisory control; Systems engineering and theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Integrated Manufacturing and Automation Technology, 1994., Proceedings of the Fourth International Conference on
Conference_Location :
Troy, NY
Print_ISBN :
0-8186-6510-6
Type :
conf
DOI :
10.1109/CIMAT.1994.389067
Filename :
389067
Link To Document :
بازگشت