Think globally, act locally: decentralized supervisory control

Rudie, Karen; Wonham, W. M.

doi:10.1109/9.173140

Cited by 470 publications

(254 citation statements)

References 13 publications

Supporting

Mentioning

250

Contrasting

Order By: Relevance

“…It is important to note that in Conj-Codiag, the only local decision made by diagnosers can be interpreted as "negative," and the system is diagnosed to be positive if and only if there is no diagnoser that reports negative. Thus, this architecture is closely analogous to the conjunctive architecture considered in Rudie and Wonham (1992), Yoo and Lafortune (2002a) for decentralized control, where "disable" is the only local decision employed and an event is enabled if no site disables it. Similarly, in Disj-Codiag, the system is diagnosed to be positive if and only if at least one diagnoser reports "positive," which is closely analogous to the disjunctive architecture in Yoo and Lafortune (2002a) for decentralized control, where an event is enabled if at least one site enables it.…”

Section: Definitionsmentioning

confidence: 89%

Diagnosis of Discrete Event Systems Using Decentralized Architectures

Wang

Yoo

Lafortune

2007

Discrete Event Dyn Syst

144

View full text Add to dashboard Cite

Decentralized diagnosis of discrete event systems has received a lot of attention to deal with distributed systems or with systems that may be too large to be diagnosed by one centralized site. This paper casts the problem of decentralized diagnosis in a new hierarchical framework. A key feature is the exploitation of different local decisions together with appropriate rules for their fusion. This includes local diagnosis decisions that can be interpreted as "conditional decisions." Under this new framework, a series of new decentralized architectures are defined and studied. The properties of their corresponding notions of decentralized diagnosability are characterized and their relationship with existing work described. Corresponding verification algorithms are also presented and on-line diagnosis strategies discussed.

show abstract

Section: Definitionsmentioning

confidence: 89%

Diagnosis of Discrete Event Systems Using Decentralized Architectures

Wang

Yoo

Lafortune

2007

Discrete Event Dyn Syst

144

View full text Add to dashboard Cite

show abstract

“…Recovery is an essential building block in fault-tolerant systems and it is the focus of this paper. In controller synthesis [4,5,13,18,19,24,30,38,41,42,46,48,55], and in particular in [30], which is in spirit close to our work, the recovery mechanism must be given as input to the DCS algorithm. Thus, one key difference between our work in this paper and DCS methods is the fact that we automatically synthesize recovery paths.…”

Section: Controller Synthesismentioning

confidence: 98%

“…4. Finally, we model distribution by specifying read/write restrictions, whereas in controller synthesis, decentralized plants are modelled through partial observability [41,48]. As mentioned earlier, the issue of distribution drastically increases the complexity of synthesis [10,33].…”

Section: Controller Synthesismentioning

confidence: 99%

Symbolic synthesis of masking fault-tolerant distributed programs

2011

View full text Add to dashboard Cite

We focus on automated addition of masking fault-tolerance to existing fault-intolerant distributed programs. Intuitively, a program is masking fault-tolerant, if it satisfies its safety and liveness specifications in the absence and presence of faults. Masking fault-tolerance is highly desirable in distributed programs, as the structure of such programs are fairly complex and they are often subject to various types of faults. However, the problem of synthesizing masking fault-tolerant distributed programs from their faultintolerant version is NP-complete in the size of the program's state space, setting the practicality of the synthesis problem in doubt. In this paper, we show that in spite of the high worst-case complexity, synthesizing moderate-sized masking distributed programs is feasible in practice. In particular, we present and implement a BDD-based synthesis heuristic for adding masking fault-tolerance to existing fault-intolerant distributed programs automatically. Our experiments validate the efficiency and effectiveness of our algorithm in the sense that synthesis is possible in reasonable amount of time and memory. We also identify several bottlenecks in synthesis of distributed programs depending upon the structure of

show abstract

“…Recovery is an essential building block in fault-tolerant systems and it is the focus of this paper. In controller synthesis [6,7,19,21,22,26,32,33,35,40,42,47], and in particular in [26], which is in spirit close to our work, the recovery mechanism must be given as input to the DCS algorithm. Thus, one key difference between our work in this paper and the methods in is the fact that we automatically synthesize recovery paths.…”

Section: Controller Synthesismentioning

confidence: 98%

“…4. Finally, we model distribution by specifying read/write restrictions, whereas in controller synthesis, decentralized plants are modelled through partial observability [33,42]. As mentioned earlier, the issue of distribution drastically increases the complexity of synthesis [14,30].…”

Section: Controller Synthesismentioning

confidence: 99%

The complexity of automated addition of fault-tolerance without explicit legitimate states

et al. 2014

View full text Add to dashboard Cite

Existing algorithms for automated model repair for adding fault-tolerance to fault-intolerant models incur an impediment that designers have to identify the set of legitimate states of the original model. This set determines states from where the original model meets its specification in the absence of faults. Experience suggests that of the inputs required for model repair, identifying such legitimate states is the most difficult. In this paper, we consider the problem of automated model repair for adding fault-tolerance where legitimate states are not explicitly given as input. We show that without this input, in some instances, the complexity of model repair increases substantially (from polynomial-time to NP-complete). In spite of this increase, we find that this formulation is relatively complete; i.e., if it was possible to perform model repair with explicit legitimate states, then it is also possible to do so without the explicit identification of the legitimate states. Finally, we show that if the problem of model repair can be solved with explicit legitimate states,

show abstract

Think globally, act locally: decentralized supervisory control

Cited by 470 publications

References 13 publications

Diagnosis of Discrete Event Systems Using Decentralized Architectures

Diagnosis of Discrete Event Systems Using Decentralized Architectures

Symbolic synthesis of masking fault-tolerant distributed programs

The complexity of automated addition of fault-tolerance without explicit legitimate states

Contact Info

Product

Resources

About