BLOCKING AND CONTROLLABILITY OF PETRI NETS IN SUPERVISORY CONTROL

被引：43

作者：

GIUA, A

DICESARE, F

机构：

[1] Electrical, Computer, Systems Engineering Department, Ressselaer Polytechnic Institute, Troy

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1994年 / 39卷 / 04期

关键词：

D O I：

10.1109/9.286260

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This note discusses the use of Petri net languages in supervisory control theory. First it is shown that the trimming of an unbounded Petri net is not always possible and a new class of Petri net languages, that may be generated by nonblocking nets, is defined. Secondly, necessary and sufficient conditions for the existence of a Petri net supervisor, under the hypothesis that the system's behavior and the legal behavior are both Petri net languages, are derived. Finally, by means of an example, it is shown that Petri net languages am not closed under the supremal controllable sublanguage operator.

引用

页码：818 / 823

页数：6

共 19 条

[1]

GIUA A, 1992, 31ST P IEEE INT C DE

[2]

GIUA A, 1993, 1993 P IFAC WORLD C

[3]

GIUA A, 1992, 30TH P IEEE INT C DE, P92

[4]

HOLLOWAY LE, 1990, IEEE T AUTOMAT CONTR, V35, P524

[5]

HUANG NQ, 1989, 27TH P ALL C COMM CO, P925

[6]

JANTZEN M, 1987, LECT NOTES COMPUT SC, V254, P397

[7]

KUMAR R, 1992, 31ST P IEEE INT C DE, P1190

[8] SOME RESULTS ON PETRI NET LANGUAGES [J].

LAFORTUNE, S ;

YOO, H .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1990, 35 (04) :482-485

[9]

LI Y, 1989, 28TH P IEEE C DEC CO, P2731

[10] PETRI NETS - PROPERTIES, ANALYSIS AND APPLICATIONS [J].

MURATA, T .

PROCEEDINGS OF THE IEEE, 1989, 77 (04) :541-580

← 1 2 →