Polynomial-time verification of diagnosability of partially observed discrete-event systems

被引：288

作者：

Yoo, TS ^{[1
]}

Lafortune, S ^{[1
]}

机构：

[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2002年 / 47卷 / 09期

基金：

美国国家科学基金会;

关键词：

computational complexity; diagnosability verification; discrete-event systems; failure diagnosis;

D O I：

10.1109/TAC.2002.802763

中图分类号：

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

学科分类号：

0812 ;

摘要：

The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier.

引用

页码：1491 / 1495

页数：5

共 5 条

[1] A polynomial algorithm for testing diagnosability of discrete-event systems [J].

Jiang, SB ;

Huang, ZD ;

Chandra, V ;

Kumar, R .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2001, 46 (08) :1318-1321

[2] THE COMPUTATIONAL-COMPLEXITY OF DECENTRALIZED DISCRETE-EVENT CONTROL-PROBLEMS [J].

RUDIE, K ;

WILLEMS, JC .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1995, 40 (07) :1313-1319

[3] DIAGNOSABILITY OF DISCRETE-EVENT SYSTEMS [J].

SAMPATH, M ;

SENGUPTA, R ;

LAFORTUNE, S ;

SINNAMOHIDEEN, K ;

TENEKETZIS, D .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1995, 40 (09) :1555-1575

[4]

Tsitsiklis J. N., 1989, Mathematics of Control, Signals, and Systems, V2, P95, DOI 10.1007/BF02551817

[5] A general architecture for decentralized supervisory control of discrete-event systems [J].

Yoo, TS ;

Lafortune, S .

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2002, 12 (03) :335-377

← 1 →