A framework for fault-tolerant control of discrete event systems

被引:51
作者
Wen, Qin [1 ]
Kumar, Ratnesh [1 ]
Huang, Jing [1 ]
Liu, Haifeng [1 ]
机构
[1] Iowa State Univ, Dept Elect & Comp Engn, Ames, IA 50011 USA
基金
美国国家科学基金会;
关键词
discrete event systems; fault-tolerance; language convergence; stability; supervisory control;
D O I
10.1109/TAC.2008.929388
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a framework for fault-tolerant supervisory control of discrete-event systems. Given a plant, possessing both faulty and nonfaulty behavior, and a submodel for just the nonfaulty part, the goal of fault-tolerant supervisory control is to enforce a certain specification for the nonfaulty plant and another (perhaps more liberal) specification for the overall plant, and further to ensure that the plant recovers from any fault within a bounded delay so that following the recovery the system state is equivalent to a nonfaulty state (as if no fault ever happened). The specification for the overall plant is more liberal compared to the one for the nonfaulty part since a degraded performance may be allowed after a fault has occurred. We formulate this notion of fault-tolerant supervisory control and provide a necessary and sufficient condition for the existence of such a supervisor. The condition involves the usual notions of controllability, observability and relative-closure, together with the notion of stability. An example of a power system is provided to illustrate the framework. We also propose a weaker notion of fault-tolerance where following the recovery, the system state is simulated by some nonfaulty state, i.e., behaviors following the recovery are also the behaviors from some faulty state. Also, we formulate the corresponding notion of weakly fault-tolerant supervisory control and present a necessary and sufficient condition (involving the notion of language-stability) for the its existence. We also introduce the notion of nonuniformly-bounded fault-tolerance (and its weak version) where the delay-bound for recovery is not uniformly bounded over the set of faulty traces, and show that when the plant model has finitely many states, this more general notion of fault-tolerance coincides with the one in which the delay-bound for recovery is uniformly bounded.
引用
收藏
页码:1839 / 1849
页数:11
相关论文
共 22 条
[1]  
ANDERSON PM, 1994, POWER SYSTEM CONTROL
[2]  
[Anonymous], 1995, MODELING CONTROL LOG
[3]   CLOSURE AND CONVERGENCE - A FOUNDATION OF FAULT-TOLERANT COMPUTING [J].
ARORA, A ;
GOUDA, M .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1993, 19 (11) :1015-1027
[4]   Component based design of multitolerant systems [J].
Arora, A ;
Kulkarni, SS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1998, 24 (01) :63-78
[5]   Synthesis of fault-tolerant concurrent programs [J].
Attie, PC ;
Arora, A ;
Emerson, EA .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2004, 26 (01) :125-185
[6]   STABILIZATION OF DISCRETE-EVENT PROCESSES [J].
BRAVE, Y ;
HEYMANN, M .
INTERNATIONAL JOURNAL OF CONTROL, 1990, 51 (05) :1101-1117
[7]   Synthesis of fault-tolerant supervisor for automated manufacturing systems: A case study on photolithographic process [J].
Cho, KH ;
Lim, JT .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1998, 14 (02) :348-351
[8]  
Cho KH, 1996, IEICE T INF SYST, VE79D, P1223
[9]  
DARASELIA N, 2003, BIOINFORMATICS, V19, P1
[10]   Communication protocols for a fault-tolerant automated highway system [J].
Godbole, DN ;
Lygeros, J ;
Singh, E ;
Deshpande, A ;
Lindsey, AE .
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2000, 8 (05) :787-800