DECIDABILITY AND CLOSURE-PROPERTIES OF WEAK PETRI-NET LANGUAGES IN SUPERVISORY CONTROL

被引：19

作者：

GIUA, A ^{[1
]}

DICESARE, F ^{[1
]}

机构：

[1] RENSSELAER POLYTECH INST,DEPT COMP SCI & ELECT ENGN,TROY,NY

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1995年 / 40卷 / 05期

关键词：

D O I：

10.1109/9.384227

中图分类号：

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

学科分类号：

0812 ;

摘要：

We extend the class of control problems that can be modeled by Petri nets considering the notion of weak terminal behavior. Deterministic weak languages represent closed-loop terminal behaviors that may be enforced by nonblocking Petri net supervisors if controllable. The class of deterministic weak PN languages is not closed under the supremal controllable sublanguage operator.

引用

页码：906 / 910

页数：5

共 16 条

[1] BLOCKING AND CONTROLLABILITY OF PETRI NETS IN SUPERVISORY CONTROL [J].

GIUA, A ;

DICESARE, F .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (04) :818-823

[2]

GIUA A, 1993, 32ND P IEEE C DEC CO, P229

[3]

GIUA A, 1994, 59 U CAGL I EL TECH

[4]

JANTZEN M, 1987, ADV PETRI NETS 198 1, P397

[5]

KOSARAJU SR, 1982, 14TH P ANN S THEOR C, P267

[6] AN ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM [J].

MAYR, EW .

SIAM JOURNAL ON COMPUTING, 1984, 13 (03) :441-460

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

MURATA, T .

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

[8]

PARIGOT M, 1986, LECT NOTES COMPUT SC, V222, P346

[9]

PELZ E, 1987, P STACS 1987, V247, P373

[10] THE CONTROL OF DISCRETE EVENT SYSTEMS [J].

RAMADGE, PJG ;

WONHAM, WM .

PROCEEDINGS OF THE IEEE, 1989, 77 (01) :81-98

← 1 2 →